Minimum Spanning Tree Problem: Prim's Algorithm
Minimum Spanning Tree Problem: Prim's Algorithm
Given a connected graph G=(V,E) and a weight d:E->R+, find a minimum spanning tree. Here is a JAVA applet demo of minimum spanning tree problem by Prim's algorithm.
a (6,9) graph
a (5,8) graph
a (10,19) graph
a (8,12) graph
SEE ALSO
Minimum Spanning Tree by
Kruskal's Algorithm
Shortest Path by
Dijkstra's Algorithm
Max Flow by
Ford-Fulkerson's Labeling Algorithm
Last Modified: Wed Sep 24 14:43:03 JST 1997
Mail to:
ikeda@is.tokushima-u.ac.jp