Description: Introduction to Algorithms: Prim algorithm used to find the undirected minimum spanning tree based graph G = (V, E), the spanning tree of the vertex set of U. ①, the v0 into the U. ②, all u ∈ U, v ∈ VU edge (u, v) ∈ E to find a minimum weight of the edge, adding spanning tree. ③, ② to find the edges of v to join U collection. If U have a collection of n elements, then the end, otherwise continue ②. The algorithm' s time complexity is O (| E | log | V |)
To Search:
File list (Check if you may need any files):
prim.c
Download