Module Kruskal


module Kruskal: sig .. end
Kruskal's algorithm.

module type G = sig .. end
Minimal graph signature for Kruskal.
module Make: 
functor (G : G) ->
functor (W : Sig.ORDERED_TYPE with type t = G.E.label) -> sig .. end
Functor providing an implementation of the Kruskal's algorithm computing spanning trees.

Generic version where union-find implementation is provided


module type UNIONFIND = sig .. end
Signature of union-find.
module Generic: 
functor (G : G) ->
functor (W : 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 the Kruskal's algorithm computing spanning trees using an user-defined union-find algorithm.