Graph.KruskalKruskal's minimum-spanning-tree algorithm.
Functor providing an implementation of Kruskal's minimum-spanning-tree algorithm. Parameter W ensures that label on edges are comparable.
module type UNIONFIND = sig ... endSignature of union-find.
module Generic
(G : G)
(W : Sig.ORDERED_TYPE with type t = G.E.label)
(UF : UNIONFIND with type elt = G.V.t) :
sig ... endFunctor 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.