A template base class for a graph traversal. More...
#include <Callback.h>
Inheritance diagram for Graph::CallbackBase< Node >:
Public Member Functions | |
| virtual bool | Stop () |
| Return true to halt the traversal. | |
| virtual void | Visit (Node) |
| Called when a node is first visited. | |
| virtual bool | Descend (Node) |
| Return true to visit the node's adjacencies. | |
| virtual void | PostVisit (Node) |
| Called after a node has been visited. | |
| virtual bool | ForwardEdge (Node i, Node j) |
| Called on traversal of edges from i to unvisited j. | |
| virtual void | CrossEdge (Node i, Node j) |
| Called on traversal of edges from i to currently visiting j. | |
| virtual void | BackEdge (Node i, Node j) |
| Called on traversal of edges from i to previously visited j. | |
| virtual void | NewComponent (Node) |
| Called when a new component is visited. | |
Detailed Description
template<class Node>
struct Graph::CallbackBase< Node >
A template base class for a graph traversal.
The call order is different between DFS and BFS traversals.
For Graph traversal, Node is set to int.
The documentation for this struct was generated from the following file:
