| 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 |
| edge() const | Sawyer::Container::Algorithm::GraphTraversal< Graph, BreadthFirstTraversalTag, ReverseTraversalTag > | inline |
| EdgeIterator typedef | Sawyer::Container::Algorithm::GraphTraversal< Graph, BreadthFirstTraversalTag, ReverseTraversalTag > | |
| event() const | Sawyer::Container::Algorithm::GraphTraversal< Graph, BreadthFirstTraversalTag, ReverseTraversalTag > | inline |
| graph() const | Sawyer::Container::Algorithm::GraphTraversal< Graph, BreadthFirstTraversalTag, ReverseTraversalTag > | inline |
| GraphTraversal(Graph &graph, unsigned significantEvents) | Sawyer::Container::Algorithm::GraphTraversal< Graph, BreadthFirstTraversalTag, ReverseTraversalTag > | inline |
| hasNext() const | Sawyer::Container::Algorithm::GraphTraversal< Graph, BreadthFirstTraversalTag, ReverseTraversalTag > | inline |
| isAtEnd() const | Sawyer::Container::Algorithm::GraphTraversal< Graph, BreadthFirstTraversalTag, ReverseTraversalTag > | inline |
| isDiscovered(VertexIterator vertex) const | Sawyer::Container::Algorithm::GraphTraversal< Graph, BreadthFirstTraversalTag, ReverseTraversalTag > | inline |
| isVisited(EdgeIterator edge) const | Sawyer::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() const | Sawyer::Container::Algorithm::GraphTraversal< Graph, BreadthFirstTraversalTag, ReverseTraversalTag > | inline |
| operator++() | Sawyer::Container::Algorithm::BreadthFirstReverseGraphTraversal< Graph > | inline |
| 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() const | Sawyer::Container::Algorithm::GraphTraversal< Graph, BreadthFirstTraversalTag, ReverseTraversalTag > | inline |
| VertexIterator typedef | Sawyer::Container::Algorithm::GraphTraversal< Graph, BreadthFirstTraversalTag, ReverseTraversalTag > | |
