Module signature PathProblem::CustomPathProblemConfigSig

To create a custom path problem, simply define the Node you want to search (which must be Locatable). Then, implement the edge relation, and start and end predicates to indicate the types of things that should be considered problems when connected in the graph.

Optionally, you can also implement the edgeInfo and nodeLabel predicates to provide additional information about the edges and nodes in the graph.

Lastly, import CustomPathProblem<YourConfig> to get the problem predicate, which holds for pairs of connected locations that will be traceable in the path problem results.

See the CallGraphPathProblemConfig module for an example of how to use this module.

Import path

import qtil.locations.CustomPathProblem

Predicates

edge	The directional edges of the graph, from `a` to `b`.
edgeInfo	Optional predicate to set additional information on the edges of the graph.
end	Where the graph search should end.
nodeLabel	Optional predicate to set a label on the nodes of the graph.
start	Where the graph search should start.

Types

Node	A class that connects nodes in the graph to search locations.