salvo.jesus.graph

Class DirectedAcyclicGraphImpl

java.lang.Object

salvo.jesus.graph.GraphImpl

salvo.jesus.graph.DirectedGraphImpl

salvo.jesus.graph.DirectedAcyclicGraphImpl

All Implemented Interfaces:

Serializable, DirectedAcyclicGraph, DirectedGraph, Graph

public class DirectedAcyclicGraphImpl
extends DirectedGraphImpl
implements 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.

Author:

Jesus M. Salvo Jr.

See Also:

Serialized Form

Field Summary

Fields inherited from class salvo.jesus.graph.GraphImpl

factory, traversal

Constructor Summary

Constructors

Constructor and Description
DirectedAcyclicGraphImpl() Creates a DirectedAcyclicGraph object.

Method Summary

Modifier and Type	Method and Description
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.DirectedGraphImpl

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

Methods inherited from class salvo.jesus.graph.GraphImpl

add, addEdge, addEdge, addGraphAddEdgeListener, addGraphAddVertexListener, addGraphRemoveEdgeListener, addGraphRemoveVertexListener, addListener, cloneVertices, containsEdge, containsVertex, forgetConnectedSets, 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, toString, traverse

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, 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

DirectedAcyclicGraphImpl

public DirectedAcyclicGraphImpl()

Creates a DirectedAcyclicGraph object.

Method Detail

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

See Also:

DirectedAcyclicGraph.getRoot()

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)