Kruskal.Make
Functor providing an implementation of Kruskal's minimum-spanning-tree algorithm. Parameter W ensures that label on edges are comparable.
W
G : G
W : Graph.Sig.ORDERED_TYPE with type t = G.E.label
val spanningtree : G.t -> G.E.t list