module Make: functor (
G
:
G
) ->
functor (
W
:
WEIGHT
with type label = G.E.label
) ->
sig
.. end
Functor providing an implementation of Prim's minimum-spanning-tree
algorithm.
Parameter W
ensures that label on edges are comparable.
Parameters: |
G |
: |
G
|
W |
: |
WEIGHT with type label = G.E.label
|
|
val spanningtree : Prim.G.t -> Prim.G.E.t list
val spanningtree_from : Prim.G.t -> G.V.t -> Prim.G.E.t list