Takes a vertex and marks it as discovered while moving backward.
More...
|
visitor_return | discover_vertex (typename VGraph::vertex_iterator vi) |
|
virtual visitor_return | discover_vertex (vertex_iterator) |
| Will be called by the traversal when a vertex is reached for the first time. More...
|
|
virtual visitor_return | examine_vertex (vertex_iterator) |
| Will be called when a vertex is reached and needs to be examined. More...
|
|
virtual visitor_return | examine_edge (vertex_iterator, vertex_descriptor) |
| Will be called when an edge is reached and needs to be examined. More...
|
|
virtual visitor_return | tree_edge (vertex_iterator, vertex_descriptor) |
| Will be called when an edge whose destination is unvisited is reached. More...
|
|
virtual visitor_return | non_tree_edge (vertex_iterator, vertex_descriptor) |
| Will be called when an edge whose destination is already visited is reached. More...
|
|
virtual visitor_return | gray_target (vertex_iterator, vertex_descriptor) |
| Will be called when an edge is reached whose destination is visited but not finished. More...
|
|
virtual visitor_return | black_target (vertex_iterator, vertex_descriptor) |
| Will be called when an edge is reached whose destination is visited and finished. More...
|
|
virtual visitor_return | finish_vertex (vertex_iterator, int=-1) |
| Will be called by traversal when a vertex becomes finished. More...
|
|
template<class VGraph>
class stapl::sequential::visitor_scc_back< VGraph >
Takes a vertex and marks it as discovered while moving backward.
- Template Parameters
-
◆ discover_vertex()
Will be called by the traversal when a vertex is reached for the first time.
- Parameters
-
◆ examine_vertex()
Will be called when a vertex is reached and needs to be examined.
- Parameters
-
◆ examine_edge()
Will be called when an edge is reached and needs to be examined.
- Parameters
-
v | Iterator to the starting vertex of the edge. |
e | Descriptor of the target vertex of the edge. |
◆ tree_edge()
Will be called when an edge whose destination is unvisited is reached.
- Parameters
-
v | Iterator to the starting vertex of the edge. |
e | Descriptor of the target vertex of the edge. |
◆ non_tree_edge()
Will be called when an edge whose destination is already visited is reached.
- Parameters
-
v | Iterator to the starting vertex of the edge. |
e | Descriptor of the target vertex of the edge. |
◆ gray_target()
Will be called when an edge is reached whose destination is visited but not finished.
- Parameters
-
v | Iterator to the starting vertex of the edge. |
e | Descriptor of the target vertex of the edge. |
◆ black_target()
Will be called when an edge is reached whose destination is visited and finished.
- Parameters
-
v | Iterator to the starting vertex of the edge. |
e | Descriptor of the target vertex of the edge. |
◆ finish_vertex()
Will be called by traversal when a vertex becomes finished.
- Parameters
-
The documentation for this class was generated from the following file: