Data.DAG.Simple

Simple vertice list based representation of DAGs and some common operations on it.

Documentation

toposort :: Ord a => [(a, a)] -> [a]

Produce a topological sorting of the given relation. If the relation is cyclic, then the result is at least some permutation of all elements of the given relation.

reachableSet :: Ord a => [a] -> [(a, a)] -> Set a

Compute the set of nodes reachable from the given set of nodes.

cyclic :: Ord a => [(a, a)] -> Bool

Is the relation cyclic.