STAPL API Reference          
Overview   Containers   Algorithms   Views   Skeletons   Run-Time System
Modules     Classes    
List of all members | Public Member Functions | Public Attributes
stapl::sequential::visitor_cc_count< Graph > Class Template Reference

Count the number of vertices in the connected component. More...

Public Member Functions

 visitor_cc_count (size_t &_cc)
 
visitor_return discover_vertex (typename Graph::vertex_iterator)
 
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...
 

Public Attributes

size_t & ccverts
 the number of vertices in the connected component
 

Detailed Description

template<class Graph>
class stapl::sequential::visitor_cc_count< Graph >

Count the number of vertices in the connected component.

Template Parameters
Graphthe graph
Returns
the number of vertices in the connected component

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
vIterator 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
vIterator 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
vIterator to the starting vertex of the edge.
eIterator 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
vIterator to the starting vertex of the edge.
eIterator 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
vIterator to the starting vertex of the edge.
eIterator 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
vIterator to the starting vertex of the edge.
eIterator 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
vIterator to the starting vertex of the edge.
eIterator 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
vIterator to the vertex.

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