Module Graph__Kruskal.Generic

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.

Parameters

Signature

val spanningtree : G.t -> G.E.t list