I mean I want to implement prim algorithm which create a most efficient tree from a graph that has the least weight and it cover all the vectors of the graph. please guide me to implement it.
Loading
Know the answer? Post it — somebody with the same question will find it here.
Sign in to answer this question
It is the same account you read, post and publish with — and you will come straight back to this page.
Joe WilsonPosted May 5, 2015, 1:27 PM
Nanhe SiddiquePosted May 5, 2015, 4:11 AM
http://www.geeksforgeeks.org/greedy-algorithms-set-5-prims-minimum-spanning-tree-mst-2/