Depth First Search visitor of tree where vertex visitations populate child_majority_marching_orders. More...
Public Member Functions | |
| DFSVotingVisitor (OrderGraphType *tree) | |
| Constructor. | |
| template<typename Vertex , typename Graph > | |
| void | finish_vertex (Vertex u, const Graph &g) |
| From Boost's documentation: "is invoked on a vertex after all of its out edges have been added to the search tree and all of the adjacent vertices have been discovered (but before their out-edges have been examined).". | |
Private Attributes | |
| OrderGraphType * | tree_ |
| Reference to the tree being visited. | |
Depth First Search visitor of tree where vertex visitations populate child_majority_marching_orders.
Definition at line 27 of file ordertree.cpp.
| OrderTree::DFSVotingVisitor::DFSVotingVisitor | ( | OrderGraphType * | tree | ) | [inline, explicit] |
| void OrderTree::DFSVotingVisitor::finish_vertex | ( | Vertex | u, | |
| const Graph & | g | |||
| ) | [inline] |
From Boost's documentation: "is invoked on a vertex after all of its out edges have been added to the search tree and all of the adjacent vertices have been discovered (but before their out-edges have been examined).".
| u | Vertex to visit | |
| g | Graph from which Vertex came |
Definition at line 46 of file ordertree.cpp.
OrderGraphType* OrderTree::DFSVotingVisitor::tree_ [private] |
Reference to the tree being visited.
Definition at line 112 of file ordertree.cpp.
1.6.3