Package [graph, traversal, iterator]

modulegraph0.0.1

Search

Filter

By: ThorstenSeitz

Values
`black`	Source Code`shared black black` black = vertex has been visited and we are not done with all of its out-edges
`gray`	Source Code`shared gray gray` gray = vertex has been visited but we are not done with all of its out-edges yet
`white`	Source Code`shared white white` white = vertex has not been visited yet

Interfaces
`EdgeIterator`	Source Code`shared EdgeIterator<V,E,G>given V satisfies Object given E satisfies Edge<V,E> given G satisfies IncidenceGraph<V,E>`
`GraphIterator`	Source Code`shared GraphIterator<V,G,Visitor>given V satisfies Object given G satisfies AdjacencyGraph<V> given Visitor satisfies TraversalVisitor<V>`
`PropagatorBasedIterator`	Source Code`shared PropagatorBasedIterator<V,G,P,Adjacency,Visitor>given V satisfies Object given G satisfies AdjacencyGraph<V> given P satisfies GraphPropagator<V,Adjacency> given Visitor satisfies TraversalVisitor<V>` Graph iterator using a `GraphPropagator` to abstract from propagating to neighbors via adjacent vertices or incident edges.
`VertexIterator`	Source Code`shared VertexIterator<V,G>given V satisfies Object given G satisfies AdjacencyGraph<V>`

Classes
`BfsIterator`	Source Code`shared abstract BfsIterator<V,G,Adjacency,P,Visitor>given V satisfies Object given G satisfies AdjacencyGraph<V> given P satisfies GraphPropagator<V,Adjacency> given Visitor satisfies TraversalVisitor<V>` Generic breadth first search traversal.
`ColorMap`	Source Code`shared ColorMap<V>given V satisfies Object` A ColorMap stores the visit state of vertices. All vertices start out colored white. Implementation note: white vertices are not stored explicitly because white is the default.
`DfsIterator`	Source Code`shared abstract DfsIterator<V,G,Adjacency,P,Visitor>given V satisfies Object given G satisfies AdjacencyGraph<V> given P satisfies GraphPropagator<V,Adjacency> given Visitor satisfies TraversalVisitor<V>` Generic depth first search traversal.
`StandardGraphIterator`	Source Code`shared abstract StandardGraphIterator<V,G,Adjacency,P,Visitor>given V satisfies Object given G satisfies AdjacencyGraph<V> given P satisfies GraphPropagator<V,Adjacency> given Visitor satisfies TraversalVisitor<V>` Generic traversal by using white/gray/black vertex colors and a collection of vertices waiting to be visited. Base for BFS (using a queue) and DFS (using a stack).
`VisitColor`	Source Code`shared abstract VisitColor` Vertex visit state is encoded by color.
`black`	Source Code`shared black` black = vertex has been visited and we are not done with all of its out-edges
`gray`	Source Code`shared gray` gray = vertex has been visited but we are not done with all of its out-edges yet
`white`	Source Code`shared white` white = vertex has not been visited yet