TopoSort.MakeSourceAbstract topological sorting module.
This implements the Trajan algorithm.
module O : OrderedHashedTypeval fold_strong_connected :
?size_hint:int ->
(O.t list -> 'a -> 'a) ->
O.t list ->
succs ->
'a ->
'afold the strongly connected components following the derived order given by succs.
Sort the strongly connected components following the derived order given by succs.
index all nodes in an order that respects the order given by succs. Nodes have the same index if and only if they are in the same strongly connected component.