stapl::sequential::visitor_cycle< GRAPH > Class Template Reference

Checks for cycles in a directed graph. It does so by returning EARLY_QUIT if a visitor is visiting a node that has already been visited. More...

Public Member Functions
visitor_return	gray_target (typename GRAPH::vertex_iterator, typename GRAPH::adj_edge_iterator)
	The visitor class function for a gray target, which will return EARLY_QUIT.
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, adj_edge_iterator)
	Will be called when an edge is reached and needs to be examined. More...
virtual visitor_return	tree_edge (vertex_iterator, adj_edge_iterator)
	Will be called when an edge whose destination is unvisited is reached. More...
virtual visitor_return	non_tree_edge (vertex_iterator, adj_edge_iterator)
	Will be called when an edge whose destination is already visited is reached. More...
virtual visitor_return	black_target (vertex_iterator, adj_edge_iterator)
	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...

Detailed Description

template<class GRAPH>
class stapl::sequential::visitor_cycle< GRAPH >

Checks for cycles in a directed graph. It does so by returning EARLY_QUIT if a visitor is visiting a node that has already been visited.

Member Function Documentation

discover_vertex()

template<class GRAPH>

virtual visitor_return stapl::visitor_base< GRAPH >::discover_vertex ( vertex_iterator  )

virtualinherited

Will be called by the traversal when a vertex is reached for the first time.

Parameters

v	Iterator to the vertex.

examine_vertex()

template<class GRAPH>

virtual visitor_return stapl::visitor_base< GRAPH >::examine_vertex ( vertex_iterator  )

virtualinherited

Will be called when a vertex is reached and needs to be examined.

Parameters

v	Iterator to the vertex.

examine_edge()

template<class GRAPH>

virtual visitor_return stapl::visitor_base< GRAPH >::examine_edge ( vertex_iterator  , adj_edge_iterator    )

virtualinherited

Will be called when an edge is reached and needs to be examined.

Parameters

v	Iterator to the starting vertex of the edge.
e	Iterator to the edge (edge data and destination vertex).

tree_edge()

template<class GRAPH>

virtual visitor_return stapl::visitor_base< GRAPH >::tree_edge ( vertex_iterator  , adj_edge_iterator    )

virtualinherited

Will be called when an edge whose destination is unvisited is reached.

Parameters

v	Iterator to the starting vertex of the edge.
e	Iterator to the edge (edge data and destination vertex).

non_tree_edge()

template<class GRAPH>

virtual visitor_return stapl::visitor_base< GRAPH >::non_tree_edge ( vertex_iterator  , adj_edge_iterator    )

virtualinherited

Will be called when an edge whose destination is already visited is reached.

Parameters

v	Iterator to the starting vertex of the edge.
e	Iterator to the edge (edge data and destination vertex).

black_target()

template<class GRAPH>

virtual visitor_return stapl::visitor_base< GRAPH >::black_target ( vertex_iterator  , adj_edge_iterator    )

virtualinherited

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	Iterator to the edge (edge data and destination vertex).

Reimplemented in stapl::sequential::visitor_back_edges< GRAPH, Container >.

finish_vertex()

template<class GRAPH>

virtual visitor_return stapl::visitor_base< GRAPH >::finish_vertex ( vertex_iterator  , int  = -1  )

virtualinherited

Will be called by traversal when a vertex becomes finished.

Parameters

v	Iterator to the vertex.

---

The documentation for this class was generated from the following file:

• find_cycle.h