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.