|
|||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
| SUMMARY: INNER | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||
java.lang.Object
|
+--jdsl.core.algo.graphtraversals.DFS
|
+--jdsl.core.algo.graphtraversals.FindCycleDFS
This class specializes DFS to determine if the connected component of the start vertex contains a cycle and if so return it. The algorithm returns an enumeration of vertices in the cycle or an empty enumeration if there is no cycle.
| Constructor Summary | |
FindCycleDFS()
|
|
| Method Summary | |
java.lang.Object |
execute(InspectableGraph g,
Vertex start,
java.lang.Object info)
|
| Methods inherited from class java.lang.Object |
equals,
getClass,
hashCode,
notify,
notifyAll,
toString,
wait,
wait,
wait |
| Constructor Detail |
public FindCycleDFS()
| Method Detail |
public java.lang.Object execute(InspectableGraph g,
Vertex start,
java.lang.Object info)
|
|||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
| SUMMARY: INNER | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||