Module Graph__.Kruskal
module Make : functor (G : G) -> functor (W : Graph.Sig.ORDERED_TYPE with type t = G.E.label) -> sig ... end
Functor providing an implementation of Kruskal's minimum-spanning-tree algorithm. Parameter
W
ensures that label on edges are comparable.
Generic version where union-find implementation is provided
module type UNIONFIND = sig ... end
Signature of union-find.
module Generic : functor (G : G) -> functor (W : Graph.Sig.ORDERED_TYPE with type t = G.E.label) -> functor (UF : UNIONFIND with type elt = G.V.t) -> sig ... end
Functor providing an implementation of Kruskal's minimum-spanning-tree algorithm using a user-defined union-find algorithm. Parameter
W
ensures that label on edges are comparable.