ROSE  0.9.10.44
Sawyer::Container::Algorithm::GraphTraversal< G, Order, Direction > Member List

This is the complete list of members for Sawyer::Container::Algorithm::GraphTraversal< G, Order, Direction >, including all inherited members.

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