Graph.Prim
module type G = sig ... end
module Make : functor (G : G) -> functor (W : Sig.WEIGHT with type edge = G.E.t) -> sig ... end
Functor providing an implementation of Prim's minimum-spanning-tree algorithm. Parameter W ensures that label on edges are comparable.
W