salvo.jesus.graph

Interface DirectedAcyclicGraph

All Superinterfaces:

DirectedGraph, Graph, Serializable

All Known Implementing Classes:

DirectedAcyclicGraphAdaptor, DirectedAcyclicGraphImpl

public interface DirectedAcyclicGraph
extends DirectedGraph

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.

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 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

Method Detail

getRoot

List getRoot()

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.

Returns:

List of vertices

topologicalSort

List topologicalSort()

See Also:

TopologicalSorting.traverse()

reverseTopologicalSort

List reverseTopologicalSort()

See Also:

TopologicalSorting.reverseTraverse()

topologicalSort

List topologicalSort(Vertex startat)

See Also:

TopologicalSorting.traverse(Vertex)

reverseTopologicalSort

List reverseTopologicalSort(Vertex startat)

See Also:

TopologicalSorting.reverseTraverse(Vertex)