public class DirectedAcyclicGraphAdaptor extends DirectedGraphDelegator implements DirectedAcyclicGraph
| Constructor and Description |
|---|
DirectedAcyclicGraphAdaptor(DirectedGraph graph)
Create a view of a DirectedGraph as a DAG.
|
| Modifier and Type | Method and Description |
|---|---|
void |
destroy()
Destroy this adaptor, making the underlying graph free to violate the
DAG property in future modifications.
|
List |
getRoot()
Returns a List of vertices that is not depended on by other vertices.
|
List |
reverseTopologicalSort() |
List |
reverseTopologicalSort(Vertex startat) |
List |
topologicalSort() |
List |
topologicalSort(Vertex startat) |
getDirectedGraph, getEdge, getIncomingAdjacentVertices, getIncomingEdges, getOutgoingAdjacentVertices, getOutgoingEdges, isCycle, isPathadd, addEdge, addEdge, addGraphAddEdgeListener, addGraphAddVertexListener, addGraphRemoveEdgeListener, addGraphRemoveVertexListener, addListener, cloneVertices, getAdjacentVertices, getAdjacentVertices, getConnectedSet, getConnectedSet, getDegree, getDegree, getEdges, getEdgesCount, getEdgeSet, getGraph, getGraphFactory, getTraversal, getVertexSet, getVertices, getVerticesCount, getVerticesIterator, isConnected, remove, removeEdge, removeEdges, removeGraphAddEdgeListener, removeGraphAddVertexListener, removeGraphRemoveEdgeListener, removeGraphRemoveVertexListener, removeListener, setGraphFactory, setTraversal, traverseclone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, waitgetEdge, getIncomingAdjacentVertices, getIncomingEdges, getOutgoingAdjacentVertices, getOutgoingEdges, isCycle, isPathadd, addEdge, addEdge, addGraphAddEdgeListener, addGraphAddVertexListener, addGraphRemoveEdgeListener, addGraphRemoveVertexListener, addListener, cloneVertices, getAdjacentVertices, getAdjacentVertices, getConnectedSet, getConnectedSet, getDegree, getDegree, getEdges, getEdgesCount, getEdgeSet, getGraphFactory, getTraversal, getVertexSet, getVertices, getVerticesCount, getVerticesIterator, isConnected, remove, removeEdge, removeEdges, removeGraphAddEdgeListener, removeGraphAddVertexListener, removeGraphRemoveEdgeListener, removeGraphRemoveVertexListener, removeListener, setGraphFactory, setTraversal, traversepublic DirectedAcyclicGraphAdaptor(DirectedGraph graph) throws CycleException
CycleException - if the given graph already contains cyclespublic void destroy()
public List getRoot()
DirectedAcyclicGraphgetRoot in interface DirectedAcyclicGraphpublic List topologicalSort()
topologicalSort in interface DirectedAcyclicGraphTopologicalSorting.traverse()public List reverseTopologicalSort()
reverseTopologicalSort in interface DirectedAcyclicGraphTopologicalSorting.reverseTraverse()public List topologicalSort(Vertex startat)
topologicalSort in interface DirectedAcyclicGraphTopologicalSorting.traverse(Vertex)public List reverseTopologicalSort(Vertex startat)
reverseTopologicalSort in interface DirectedAcyclicGraphTopologicalSorting.reverseTraverse(Vertex)Copyright © 2019 JULIE Lab, Germany. All rights reserved.