|
Class Summary |
| AbstractGraphTraversalAlg |
Abstract base class for DFS- and BFS-traversal. |
| BreadthFirstSearchImpl |
|
| ConstructPredMapVisitor |
|
| DFSFinishedNodeOnStackVisitor |
Puts all nodes on a NodeStack upon finishing their visit. |
| DFSNodeNumberingVisitor |
|
| DFSNodeStackVisitor |
Maintains a stack of currently opened nodes during the DFS. |
| FindPathByTraversalAlg |
|
| IdleDFSVisitor |
Utility DFSVisitor with empty implementations for all necessary methods
of the interface DFSVisitor. |
| IdleTraversalVisitor |
|
| NodeCountVisitor |
|
| RecursiveDFSImpl |
A recursive implementation of the Depth First Search algorithm. |
