|
|||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: INNER | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Object | +--jdsl.graph.algo.DFS | +--jdsl.graph.algo.DirectedDFS
Fields inherited from class jdsl.graph.algo.DFS |
BACK_EDGE, CROSS_EDGE, EDGE_TYPE, FINISH_TIME, FORWARD_EDGE, graph_, PARENT, START_TIME, TREE_EDGE, TREE_NUMBER, treeNum_, UNSEEN, UNVISITED, VERTEX_STATUS, VISITED, VISITING, visitResult_ |
Constructor Summary | |
DirectedDFS()
|
Method Summary | |
protected EdgeIterator |
interestingIncidentEdges(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.DFS |
cleanup, dfsVisit, execute, execute, finishTime, finishVisit, isBackEdge, isCrossEdge, isDone, isForwardEdge, isTreeEdge, isUnseen, isUnvisited, isVisited, isVisiting, parent, startTime, startVisit, status, traverseBackEdge, traverseCrossEdge, traverseForwardEdge, traverseTreeEdge, treeNumber, type |
Methods inherited from class java.lang.Object |
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
Constructor Detail |
public DirectedDFS()
Method Detail |
protected EdgeIterator interestingIncidentEdges(Vertex v)
interestingIncidentEdges
in class DFS
Vertex
- The vertex for which to find interesting edges
|
|||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: INNER | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |