Module Avl_topo

module Avl_topo: sig  end

Topological sort of a graph.

Let G be a graph whose nodes are x₁, ..., x_n. Sorting G in the topological order consists in enumerating succesivelly the nodes x_s(1), ..., x_s(n) such that for all i and j, if G has an edge x_s(i) -> x_(j) then i < j.

module type GRAPH = sig  end

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