stapl::sequential::hops_detail::hops_visitor< Graph > Class Template Reference

Find all of the vertices that are no more than m_limit hops away from the source vertex. More...

Public Member Functions
	hops_visitor (Graph &_g, map_type &_map, size_t _limit, vector< vertex_descriptor > &_vec)
visitor_return	tree_edge (vertex_iterator vi, edge_iterator ei)
size_t	get_count ()
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	gray_target (vertex_iterator, adj_edge_iterator)
	Will be called when an edge is reached whose destination is visited but not finished. 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<typename Graph>
class stapl::sequential::hops_detail::hops_visitor< Graph >

Find all of the vertices that are no more than m_limit hops away from the source vertex.

Template Parameters

Graph

the graph being traversed

Note

Visitor for use with BFS-early-quit.

Member Function Documentation

discover_vertex()

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()

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()

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()

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()

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).

gray_target()

virtual visitor_return stapl::visitor_base< Graph >::gray_target ( vertex_iterator  , adj_edge_iterator    )

virtualinherited

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

black_target()

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).

finish_vertex()

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:

• count_hop_pairs.h