wat's prim's algorithm?

[larsa]

im a fresher! i wanna knw the prim's algorithm binary trees , graphs can u send me some programs on it! IN C language!

[Sandhya.Kishannag]

Prim's algorithm is an algorithm in graph theory that finds a minimum spanning tree for a connected weighted graph. This means it finds a subset of the edges that forms a tree that includes every vertex, where the total weight of all the edges in the tree is minimized.

For program check the link "Can you give the prim's algorithm program in c"

[Sandhya.Kishannag]

Prim's algorithm finds minimum spanning tree for a connected weighted undirected graph. This means it finds a subset of the edges that forms a tree that includes every vertex, where the total weight of all the edges in the tree is minimized.The algorithm was developed by Robert C. Prim in 1957 and rediscovered by Edsger Dijkstra in 1959. Therefore it is also sometimes called the DJP algorithm.

For c program check the link Prim's algorithm in C