Let G be a graph whose nodes are x1, ..., xn. Sorting
G in the topological order consists in enumerating succesivelly the
nodes xs(1), ..., xs(n) such that for all i and j, if
G has an edge xs(i) -> x(j) then i < j.
module type GRAPH =
functor (X : GRAPH) -> sig end