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

Additional Inherited Members

- Public Types inherited from Sawyer::Container::Algorithm::GraphTraversal< G, Order, Direction >
typedef G Graph
 
typedef GraphTraits< Graph >::VertexIterator VertexIterator
 Const or non-const vertex node iterator.
 
typedef GraphTraits< Graph >::EdgeIterator EdgeIterator
 Const or non-const edge node iterator.
 
- Protected Types inherited from Sawyer::Container::Algorithm::GraphTraversal< G, Order, Direction >
typedef std::list< WorkWorkList
 
- Protected Member Functions inherited from Sawyer::Container::Algorithm::GraphEdgeTraversal< Graph, BreadthFirstTraversalTag, ForwardTraversalTag >
 GraphEdgeTraversal (Graph &graph)
 
- Protected Member Functions inherited from Sawyer::Container::Algorithm::GraphTraversal< G, Order, Direction >
Workcurrent ()
 
const Workcurrent () 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< G, Order, Direction >
WorkList workList_
 

Constructor & Destructor Documentation

◆ BreadthFirstForwardEdgeTraversal() [1/3]

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

Start traversal at specified vertex.

Definition at line 1214 of file GraphTraversal.h.

References Sawyer::Container::Algorithm::GraphTraversal< G, Order, Direction >::start().

◆ BreadthFirstForwardEdgeTraversal() [2/3]

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

Start traversal at specified edge.

Definition at line 1220 of file GraphTraversal.h.

References Sawyer::Container::Algorithm::GraphTraversal< G, Order, Direction >::start().

◆ BreadthFirstForwardEdgeTraversal() [3/3]

template<class Graph >
Sawyer::Container::Algorithm::BreadthFirstForwardEdgeTraversal< Graph >::BreadthFirstForwardEdgeTraversal ( Graph &  graph)
inline

Start traversal at edge number zero.

Definition at line 1226 of file GraphTraversal.h.

References Sawyer::Container::Algorithm::GraphTraversal< G, Order, Direction >::start().

Member Function Documentation

◆ operator++()

Advance traversal to next event.

Definition at line 1232 of file GraphTraversal.h.

References Sawyer::Container::Algorithm::GraphTraversal< G, Order, Direction >::advance().


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