ROSE  0.9.10.2
Public Member Functions | List of all members
Sawyer::Container::Algorithm::BreadthFirstForwardEdgeTraversal< Graph > Class Template Reference

Description

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

Breadth-first, forward traversal for edges.

This traversal follows edges in their natural order from source to target visiting sibling edges before children. The advancing methods and operators (advance, next, etc.) stop only at edge enter events (ENTER_EDGE). Dereferencing the traversal object returns a graph edge node.

Definition at line 1211 of file GraphTraversal.h.

#include <GraphTraversal.h>

Inheritance diagram for Sawyer::Container::Algorithm::BreadthFirstForwardEdgeTraversal< Graph >:
Inheritance graph
[legend]
Collaboration diagram for Sawyer::Container::Algorithm::BreadthFirstForwardEdgeTraversal< Graph >:
Collaboration graph
[legend]

Public Member Functions

 BreadthFirstForwardEdgeTraversal (Graph &graph, typename GraphTraits< Graph >::VertexIterator startVertex)
 Start traversal at specified vertex. More...
 
 BreadthFirstForwardEdgeTraversal (Graph &graph, typename GraphTraits< Graph >::EdgeIterator startEdge)
 Start traversal at specified edge. More...
 
 BreadthFirstForwardEdgeTraversal (Graph &graph)
 Start traversal at edge number zero. More...
 
BreadthFirstForwardEdgeTraversaloperator++ ()
 Advance traversal to next event. More...
 
- Public Member Functions inherited from Sawyer::Container::Algorithm::GraphEdgeTraversal< Graph, BreadthFirstTraversalTag, ForwardTraversalTag >
GraphTraits< Graph >
::EdgeIterator::Reference 
operator* ()
 Return reference to current edge. More...
 
GraphTraits< Graph >
::EdgeIterator::Pointer 
operator-> ()
 Return pointer to current edge. More...
 
GraphTraits< Graph >
::EdgeIterator::Reference 
next ()
 Return reference to current edge and advance. More...
 
- Public Member Functions inherited from Sawyer::Container::Algorithm::GraphTraversal< Graph, BreadthFirstTraversalTag, ForwardTraversalTag >
 GraphTraversal (Graph &graph, unsigned significantEvents)
 Construct traversal for graph. More...
 
void start (VertexIterator startVertex)
 Restart the traversal at the specified vertex. More...
 
void start (EdgeIterator startEdge)
 Restart the traversal at the specified edge. More...
 
Graph & graph () const
 The graph over which iteration occurs. More...
 
TraversalEvent event () const
 Current event on which traversal is stopped. More...
 
VertexIterator vertex () const
 Vertex to which traversal is pointing. More...
 
EdgeIterator edge () const
 Edge to which traversal is pointing. More...
 
bool isAtEnd () const
 Returns true when traversal reaches the end. More...
 
bool hasNext () const
 Returns true when a traversal can be advanced. More...
 
TraversalEvent advance ()
 Advance traversal to next interesting event. More...
 
void skipChildren ()
 Causes traversal to skip children. More...
 
void allowRediscovery (VertexIterator vertex)
 Allow a vertex to be discovered again. More...
 
bool isDiscovered (VertexIterator vertex) const
 True if the vertex has been discovered. More...
 
bool isVisited (EdgeIterator edge) const
 True if the edge has been entered. More...
 
 operator unspecified_bool () const
 Type for Boolean context. More...
 
void mapVertices (Functor &f)
 Call the specified functor for each vertex. More...
 
void mapVertices (const Functor &f)
 Call the specified functor for each vertex. More...
 
void mapEdges (Functor &f)
 Call the specified functor for each edge. More...
 
void mapEdges (const Functor &f)
 Call the specified functor for each edge. More...
 

Additional Inherited Members

- Public Types inherited from Sawyer::Container::Algorithm::GraphTraversal< Graph, BreadthFirstTraversalTag, ForwardTraversalTag >
typedef Graph Graph
 
typedef GraphTraits< Graph >
::VertexIterator 
VertexIterator
 Const or non-const vertex node iterator. More...
 
typedef GraphTraits< Graph >
::EdgeIterator 
EdgeIterator
 Const or non-const edge node iterator. More...
 
- Protected Types inherited from Sawyer::Container::Algorithm::GraphTraversal< Graph, BreadthFirstTraversalTag, ForwardTraversalTag >
typedef std::list< Work > WorkList
 
- Protected Member Functions inherited from Sawyer::Container::Algorithm::GraphEdgeTraversal< Graph, BreadthFirstTraversalTag, ForwardTraversalTag >
 GraphEdgeTraversal (Graph &graph)
 
- Protected Member Functions inherited from Sawyer::Container::Algorithm::GraphTraversal< Graph, BreadthFirstTraversalTag, ForwardTraversalTag >
Work & current ()
 
const Work & current () const
 
bool isSignificant (TraversalEvent event) const
 
void setDiscovered (VertexIterator vertex, bool isDiscovered=true)
 
void setVisited (EdgeIterator edge, bool isVisited=true)
 
void clear ()
 
- Protected Attributes inherited from Sawyer::Container::Algorithm::GraphTraversal< Graph, BreadthFirstTraversalTag, ForwardTraversalTag >
WorkList workList_
 

Constructor & Destructor Documentation

template<class Graph >
Sawyer::Container::Algorithm::BreadthFirstForwardEdgeTraversal< Graph >::BreadthFirstForwardEdgeTraversal ( Graph &  graph,
typename GraphTraits< Graph >::VertexIterator  startVertex 
)
inline
template<class Graph >
Sawyer::Container::Algorithm::BreadthFirstForwardEdgeTraversal< Graph >::BreadthFirstForwardEdgeTraversal ( Graph &  graph,
typename GraphTraits< Graph >::EdgeIterator  startEdge 
)
inline

Member Function Documentation


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