Module Graph__.Topological
module Make_stable : functor (G : sig ... end) -> sig ... end
Provide the same features than
Make
, except that the resulting topological ordering is stable according to vertices comparison: if two verticesv1
andv2
are topologically equal,v1
is presented first to the iterator if and only ifG.V.compare v1 v2 <= 0
. In particular, the resulting order is not dependent on the provided hash function. This property is not guaranteed by the functorMake
. The counterpart is a less efficient implementation: worst time complexity is O(E*V*ln(V)) instead of O(E*V) (with E = number of edges and V = number of vertices.