(New page: Prim's algorithm is a graph algorithm to determine a minimum spanning tree for a connected weighted graph. This means it finds a subset of the edges that forms a tree including every verte...) |
(No difference)
|
Latest revision as of 11:54, 11 April 2008
Prim's algorithm is a graph algorithm to determine a minimum spanning tree for a connected weighted graph. This means it finds a subset of the edges that forms a tree including every vertex, in which the sum of weights of all the edges in the tree is minimized. The steps in this algorithm can be seen here http://students.ceid.upatras.gr/~papagel/project/pseuprim.htm
The Java applet demos for Prim's algorithm can be seen here: http://www.mincel.com/java/prim.html http://www.cs.usask.ca/resources/tutorials/csconcepts/1999_8/tutorial/advanced/prim/prim_kruskal.html
