|
|||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
| SUMMARY: INNER | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||
java.lang.Object
|
+--jdsl.graph.algo.BFS
|
+--jdsl.graph.algo.DBFS
Class extending BFS to create a directed Breadth First Search.
| Fields inherited from class jdsl.graph.algo.BFS |
CROSS_EDGE, DISCOVERY_EDGE, graph |
| Constructor Summary | |
DBFS()
|
|
| Method Summary | |
protected EdgeIterator |
interestingEdges(Vertex v)
This implementation of interestingEdges(Vertex) returns all of the directed edges originating at the parameter Vertex. |
| Methods inherited from class jdsl.graph.algo.BFS |
depth, execute, finishVisit, initialize, isCrossEdge, isDiscoveryEdge, isMarked, isMarked, mark, mark, result, startVisit, traverseCross, traverseDiscovery |
| Methods inherited from class java.lang.Object |
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
| Constructor Detail |
public DBFS()
| Method Detail |
protected EdgeIterator interestingEdges(Vertex v)
interestingEdges in class BFSVertex - The vertex for which to find interesting edges
|
|||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
| SUMMARY: INNER | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||