Module Avl_topo

module Avl_topo: sig  end
Topological sort of a graph.

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.

The client must provide an implementation of graph which fullfills the signature GRAPH.

module type GRAPH = sig  end
module Make: functor (X : GRAPH) -> sig  end