|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
public interface DirectedAcyclicGraph
The DirectedAcyclicGraph class represents a directed acyclic graph (DAG) where there is no cyclic paths for any of its vertices. A cylic path is a path from a vertex back to itself by following the direction of the edges.
Method Summary | |
---|---|
java.util.Collection |
getRoot()
Returns a Vector of vertices that is not depended on by other vertices. |
java.util.Vector |
reverseTopologicalSort()
Perform a reverse topological sort of the entire directed acyclic graph. |
java.util.Vector |
reverseTopologicalSort(Vertex startat)
Perform a reverse topological sort of the connected set of a directed acyclic graph to which Vertex startat belongs, starting at Vertex startat. |
java.util.Vector |
topologicalSort()
Perform a topological sort of the entire directed acyclic graph. |
java.util.Vector |
topologicalSort(Vertex startat)
Perform a topological sort of the connected set of a directed acyclic graph to which Vertex startat belongs, starting at Vertex startat. |
Methods inherited from interface salvo.jesus.graph.DirectedGraph |
---|
getEdge, getIncomingAdjacentVertices, getIncomingEdges, getOutgoingAdjacentVertices, getOutgoingEdges, isCycle, isPath |
Method Detail |
---|
java.util.Collection getRoot()
java.util.Vector topologicalSort()
reverseTopologicalSort()
java.util.Vector reverseTopologicalSort()
topologicalSort()
java.util.Vector topologicalSort(Vertex startat)
startat
- The Vertex to which you want to start the traversal.
java.util.Vector reverseTopologicalSort(Vertex startat)
startat
- The Vertex to which you want to start the traversal.
|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |