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.
SEE ALSO
Last Modified: Wed Sep 24 14:43:03 JST 1997
Mail to: ikeda@is.tokushima-u.ac.jp