I was wondering if any minimum spanning tree of a graph G can be provided by an execution of the algorithm Prim on this graph?
Does the Prim algorithm give us all the possible MST?
Graph algorithms Prim
De openkb
Sommaire |
Questions
Answers
I was wondering if any minimum spanning tree of a graph G can be provided by an execution of the algorithm Prim on this graph?
http://www-b2.is.tokushima-u.ac.jp/~ikeda/suuri/dijkstra/Prim.shtml http://www-b2.is.tokushima-u.ac.jp/~ikeda/suuri/dijkstra/Prim.shtml
Prim s algorithm is known to be a good algorithm to find a minimum spanning tree.
Source
License : cc by-sa 3.0
http://stackoverflow.com/questions/12141934/graph-algorithms-prim
