org.delia.sort.topo

Class TopologicalSort

java.lang.Object

org.delia.sort.topo.TopologicalSort

public class TopologicalSort
extends Object

Constructor Summary

Constructors

Constructor and Description
TopologicalSort()

Method Summary

Modifier and Type	Method and Description
static <T> List<T>	sort(DirectedGraph<T> g) Given a directed acyclic graph, returns a topological sorting of the nodes in the graph.

Methods inherited from class java.lang.Object

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

Constructor Detail

TopologicalSort

public TopologicalSort()

Method Detail

sort

public static <T> List<T> sort(DirectedGraph<T> g)

Given a directed acyclic graph, returns a topological sorting of the nodes in the graph. If the input graph is not a DAG, throws an IllegalArgumentException.

Parameters:

g - A directed acyclic graph.

Returns:

A topological sort of that graph.

Throws:

IllegalArgumentException - If the graph is not a DAG.