de.spricom.dessert.util

Class Dag<T>

java.lang.Object

de.spricom.dessert.util.Dag<T>

Type Parameters:

T - The node type.

public final class Dag<T>
extends Object

This class implements the Depth-first search algorithm (see https://en.wikipedia.org/wiki/Topological_sorting) to detect illegal cycles on a directed acyclic graph.

Constructor Summary

Constructors

Constructor and Description
Dag()

Method Summary

Modifier and Type	Method and Description
void	addEdge(T from, T to)
List<T>	cycle()
boolean	isCycleFree()

Methods inherited from class java.lang.Object

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

Constructor Detail

Dag

public Dag()

Method Detail

addEdge

public void addEdge(T from,
                    T to)

isCycleFree

public boolean isCycleFree()

cycle

public List<T> cycle()