SearchStrategy
A pluggable graph-traversal algorithm, generic over the kind of state it threads through the traversal (e.g. the current depth, for BreadthFirst/DepthFirst). Rather than Graph baking in a fixed set of traversal orders, it delegates to a SearchStrategy via Graph.asSequence/Graph.asIterable, so new orders (e.g. a custom best-first search) can be added without touching Graph itself. See AbstractSearchStrategy for a base class handling the traversal's bookkeeping (the fringe of edges still to explore), leaving concrete strategies to only decide which edge to explore next.
Type Parameters
is the type of the payload carried by the graph's nodes
is the type of the graph's edge weights
is the type of the state this strategy threads through the traversal
Inheritors
Properties
The state associated with the very first node of any traversal performed by search.