Same as above, but for indexed graphs. More...
#include <Callback.h>
Inheritance diagram for Graph::TimeIntCallback:
Public Member Functions | |
| TimeIntCallback (int numNodes) | |
| virtual void | Visit (int n) |
| Called when a node is first visited. | |
| virtual void | PostVisit (int n) |
| Called after a node has been visited. | |
 Public Member Functions inherited from Graph::CallbackBase< int > | |
| virtual bool | Stop () |
| Return true to halt the traversal. | |
| virtual bool | Descend (int) |
| Return true to visit the node's adjacencies. | |
| virtual bool | ForwardEdge (inti, intj) |
| Called on traversal of edges from i to unvisited j. | |
| virtual void | CrossEdge (inti, intj) |
| Called on traversal of edges from i to currently visiting j. | |
| virtual void | BackEdge (inti, intj) |
| Called on traversal of edges from i to previously visited j. | |
| virtual void | NewComponent (int) |
| Called when a new component is visited. | |
Public Attributes | |
| int | time |
| std::vector< int > | startTime |
| std::vector< int > | finishTime |
Detailed Description
Same as above, but for indexed graphs.
The documentation for this struct was generated from the following file:
