salvo.jesus.graph.adaptor

Class DirectedAcyclicGraphAdaptor

java.lang.Object

salvo.jesus.graph.adaptor.GraphDelegator

salvo.jesus.graph.adaptor.DirectedGraphDelegator

salvo.jesus.graph.adaptor.DirectedAcyclicGraphAdaptor

All Implemented Interfaces:

Serializable, DirectedAcyclicGraph, DirectedGraph, Graph

public class DirectedAcyclicGraphAdaptor
extends DirectedGraphDelegator
implements DirectedAcyclicGraph

DirectedAcyclicGraphAdaptor allows an underlying DirectedGraph to be viewed as a DirectedAcyclicGraph. This is useful when you know a DirectedGraph contains no cycles, and want to use it in an algorithm that expects a DAG. The DirectedGraph has the DAG property enforced for as long as the adaptor is attached.

Author:

John V. Sichi

See Also:

Serialized Form

Constructor Summary

Constructors

Constructor and Description
DirectedAcyclicGraphAdaptor(DirectedGraph graph) Create a view of a DirectedGraph as a DAG.

Method Summary

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)

Methods inherited from class salvo.jesus.graph.adaptor.DirectedGraphDelegator

getDirectedGraph, getEdge, getIncomingAdjacentVertices, getIncomingEdges, getOutgoingAdjacentVertices, getOutgoingEdges, isCycle, isPath

Methods inherited from class salvo.jesus.graph.adaptor.GraphDelegator

add, 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, traverse

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Methods inherited from interface salvo.jesus.graph.DirectedGraph

getEdge, getIncomingAdjacentVertices, getIncomingEdges, getOutgoingAdjacentVertices, getOutgoingEdges, isCycle, isPath

Methods inherited from interface salvo.jesus.graph.Graph

add, 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, traverse

Constructor Detail

DirectedAcyclicGraphAdaptor

public DirectedAcyclicGraphAdaptor(DirectedGraph graph)
                            throws CycleException

Create a view of a DirectedGraph as a DAG.

Throws:

CycleException - if the given graph already contains cycles

Method Detail

destroy

public void destroy()

Destroy this adaptor, making the underlying graph free to violate the DAG property in future modifications.

getRoot

public List getRoot()

Description copied from interface: DirectedAcyclicGraph

Returns a List of vertices that is not depended on by other vertices. That is, a List of vertices where there are no Edges pointing to it.

Specified by:

getRoot in interface DirectedAcyclicGraph

Returns:

List of vertices

topologicalSort

public List topologicalSort()

Specified by:

topologicalSort in interface DirectedAcyclicGraph

See Also:

TopologicalSorting.traverse()

reverseTopologicalSort

public List reverseTopologicalSort()

Specified by:

reverseTopologicalSort in interface DirectedAcyclicGraph

See Also:

TopologicalSorting.reverseTraverse()

topologicalSort

public List topologicalSort(Vertex startat)

Specified by:

topologicalSort in interface DirectedAcyclicGraph

See Also:

TopologicalSorting.traverse(Vertex)

reverseTopologicalSort

public List reverseTopologicalSort(Vertex startat)

Specified by:

reverseTopologicalSort in interface DirectedAcyclicGraph

See Also:

TopologicalSorting.reverseTraverse(Vertex)