ROSE  0.9.10.75
Sawyer::Container::Algorithm::BreadthFirstReverseGraphTraversal< Graph > Member List

This is the complete list of members for Sawyer::Container::Algorithm::BreadthFirstReverseGraphTraversal< Graph >, including all inherited members.

advance()Sawyer::Container::Algorithm::GraphTraversal< Graph, BreadthFirstTraversalTag, ReverseTraversalTag >inline
allowRediscovery(VertexIterator vertex)Sawyer::Container::Algorithm::GraphTraversal< Graph, BreadthFirstTraversalTag, ReverseTraversalTag >inline
BreadthFirstReverseGraphTraversal(Graph &graph, typename GraphTraits< Graph >::VertexIterator startVertex, unsigned significantEvents=ALL_EVENTS)Sawyer::Container::Algorithm::BreadthFirstReverseGraphTraversal< Graph >inline
BreadthFirstReverseGraphTraversal(Graph &graph, typename GraphTraits< Graph >::EdgeIterator startEdge, unsigned significantEvents=ALL_EVENTS)Sawyer::Container::Algorithm::BreadthFirstReverseGraphTraversal< Graph >inline
clear() (defined in Sawyer::Container::Algorithm::GraphTraversal< Graph, BreadthFirstTraversalTag, ReverseTraversalTag >)Sawyer::Container::Algorithm::GraphTraversal< Graph, BreadthFirstTraversalTag, ReverseTraversalTag >inlineprotected
current() (defined in Sawyer::Container::Algorithm::GraphTraversal< Graph, BreadthFirstTraversalTag, ReverseTraversalTag >)Sawyer::Container::Algorithm::GraphTraversal< Graph, BreadthFirstTraversalTag, ReverseTraversalTag >inlineprotected
current() const (defined in Sawyer::Container::Algorithm::GraphTraversal< Graph, BreadthFirstTraversalTag, ReverseTraversalTag >)Sawyer::Container::Algorithm::GraphTraversal< Graph, BreadthFirstTraversalTag, ReverseTraversalTag >inlineprotected
edge() constSawyer::Container::Algorithm::GraphTraversal< Graph, BreadthFirstTraversalTag, ReverseTraversalTag >inline
EdgeIterator typedefSawyer::Container::Algorithm::GraphTraversal< Graph, BreadthFirstTraversalTag, ReverseTraversalTag >
event() constSawyer::Container::Algorithm::GraphTraversal< Graph, BreadthFirstTraversalTag, ReverseTraversalTag >inline
graph() constSawyer::Container::Algorithm::GraphTraversal< Graph, BreadthFirstTraversalTag, ReverseTraversalTag >inline
Graph typedef (defined in Sawyer::Container::Algorithm::GraphTraversal< Graph, BreadthFirstTraversalTag, ReverseTraversalTag >)Sawyer::Container::Algorithm::GraphTraversal< Graph, BreadthFirstTraversalTag, ReverseTraversalTag >
GraphTraversal(Graph &graph, unsigned significantEvents)Sawyer::Container::Algorithm::GraphTraversal< Graph, BreadthFirstTraversalTag, ReverseTraversalTag >inline
hasNext() constSawyer::Container::Algorithm::GraphTraversal< Graph, BreadthFirstTraversalTag, ReverseTraversalTag >inline
isAtEnd() constSawyer::Container::Algorithm::GraphTraversal< Graph, BreadthFirstTraversalTag, ReverseTraversalTag >inline
isDiscovered(VertexIterator vertex) constSawyer::Container::Algorithm::GraphTraversal< Graph, BreadthFirstTraversalTag, ReverseTraversalTag >inline
isSignificant(TraversalEvent event) const (defined in Sawyer::Container::Algorithm::GraphTraversal< Graph, BreadthFirstTraversalTag, ReverseTraversalTag >)Sawyer::Container::Algorithm::GraphTraversal< Graph, BreadthFirstTraversalTag, ReverseTraversalTag >inlineprotected
isVisited(EdgeIterator edge) constSawyer::Container::Algorithm::GraphTraversal< Graph, BreadthFirstTraversalTag, ReverseTraversalTag >inline
mapEdges(Functor &f)Sawyer::Container::Algorithm::GraphTraversal< Graph, BreadthFirstTraversalTag, ReverseTraversalTag >inline
mapEdges(const Functor &f)Sawyer::Container::Algorithm::GraphTraversal< Graph, BreadthFirstTraversalTag, ReverseTraversalTag >inline
mapVertices(Functor &f)Sawyer::Container::Algorithm::GraphTraversal< Graph, BreadthFirstTraversalTag, ReverseTraversalTag >inline
mapVertices(const Functor &f)Sawyer::Container::Algorithm::GraphTraversal< Graph, BreadthFirstTraversalTag, ReverseTraversalTag >inline
operator unspecified_bool() constSawyer::Container::Algorithm::GraphTraversal< Graph, BreadthFirstTraversalTag, ReverseTraversalTag >inline
operator++()Sawyer::Container::Algorithm::BreadthFirstReverseGraphTraversal< Graph >inline
setDiscovered(VertexIterator vertex, bool isDiscovered=true) (defined in Sawyer::Container::Algorithm::GraphTraversal< Graph, BreadthFirstTraversalTag, ReverseTraversalTag >)Sawyer::Container::Algorithm::GraphTraversal< Graph, BreadthFirstTraversalTag, ReverseTraversalTag >inlineprotected
setVisited(EdgeIterator edge, bool isVisited=true) (defined in Sawyer::Container::Algorithm::GraphTraversal< Graph, BreadthFirstTraversalTag, ReverseTraversalTag >)Sawyer::Container::Algorithm::GraphTraversal< Graph, BreadthFirstTraversalTag, ReverseTraversalTag >inlineprotected
skipChildren()Sawyer::Container::Algorithm::GraphTraversal< Graph, BreadthFirstTraversalTag, ReverseTraversalTag >inline
start(VertexIterator startVertex)Sawyer::Container::Algorithm::GraphTraversal< Graph, BreadthFirstTraversalTag, ReverseTraversalTag >inline
start(EdgeIterator startEdge)Sawyer::Container::Algorithm::GraphTraversal< Graph, BreadthFirstTraversalTag, ReverseTraversalTag >inline
vertex() constSawyer::Container::Algorithm::GraphTraversal< Graph, BreadthFirstTraversalTag, ReverseTraversalTag >inline
VertexIterator typedefSawyer::Container::Algorithm::GraphTraversal< Graph, BreadthFirstTraversalTag, ReverseTraversalTag >
WorkList typedef (defined in Sawyer::Container::Algorithm::GraphTraversal< Graph, BreadthFirstTraversalTag, ReverseTraversalTag >)Sawyer::Container::Algorithm::GraphTraversal< Graph, BreadthFirstTraversalTag, ReverseTraversalTag >protected
workList_ (defined in Sawyer::Container::Algorithm::GraphTraversal< Graph, BreadthFirstTraversalTag, ReverseTraversalTag >)Sawyer::Container::Algorithm::GraphTraversal< Graph, BreadthFirstTraversalTag, ReverseTraversalTag >protected