Public Member Functions | Public Attributes | List of all members
Sawyer::Container::Algorithm::IdAccumulator< Graph > Class Template Reference


template<class Graph>
class Sawyer::Container::Algorithm::IdAccumulator< Graph >

Accumulates vertex or edge IDs.

This is a vertex or edge visitor that accumulates the IDs of the vertices or edges that are visited. It can be passed as the functor for any of the functor-calling traversal functions.

Definition at line 1401 of file GraphTraversal.h.

#include <GraphTraversal.h>

Collaboration diagram for Sawyer::Container::Algorithm::IdAccumulator< Graph >:
Collaboration graph

Public Member Functions

 IdAccumulator (size_t n)
void operator() (typename GraphTraits< Graph >::VertexIterator v)
void operator() (typename GraphTraits< Graph >::VertexIterator v, typename GraphTraits< Graph >::VertexIterator)
void operator() (typename GraphTraits< Graph >::EdgeIterator e)
void operator() (typename GraphTraits< Graph >::EdgeIterator e, typename GraphTraits< Graph >::EdgeIterator)

Public Attributes

std::vector< size_t > ids

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