Description: Suppose G = (V, E) is connected, TE minimum spanning tree of G on the set of edges. Algorithm from U = {u0} (u0 ∈ V), TE = {} begin. Repeat the following: In all u ∈ U, v ∈ V-U edge (u, v) ∈ E, find a minimum weight edge (u0, v0) into the collection TE, while v0 into the U, until V = U so far.
To Search:
File list (Check if you may need any files):
prim
....\prim.cpp
Download