Class BFSPathFinder<T>
java.lang.Object
com.ibm.wala.util.graph.traverse.BFSPathFinder<T>
This class searches breadth-first for node that matches some criteria. If found, it reports a
path to the first node found.
This class follows the outNodes of the graph nodes to define the graph, but this behavior can be changed by overriding the getConnected method.
TODO: if finding many paths, use a dynamic programming algorithm instead of calling this repeatedly.
-
Constructor Summary
ConstructorDescriptionConstruct a breadth-first enumerator across the (possibly improper) subset of nodes reachable from the nodes in the given enumeration.Construct a breadth-first enumerator starting with any of a set of nodes in a directed graph.Construct a breadth-first enumerator starting with a particular node in a directed graph.Construct a breadth-first enumerator starting with a particular node in a directed graph.BFSPathFinder
(Graph<T> G, T src, T target) Construct a breadth-first enumerator starting with a particular node in a directed graph. -
Method Summary
-
Constructor Details
-
BFSPathFinder
-
BFSPathFinder
Construct a breadth-first enumerator starting with a particular node in a directed graph.- Parameters:
G
- the graph whose nodes to enumerate- Throws:
IllegalArgumentException
- if G is null
-
BFSPathFinder
-
BFSPathFinder
-
BFSPathFinder
-
-
Method Details
-
find
-
getConnected
-