Prim's Algorithm in Java.

Implement Prims algorithm and run it on a weighted graph of your own creation in Java. The algorithm is used to find the minimum spanning tree in a graph. This is a greedy algorithm traverses each edge of the graph only keeping the smallest connections to each node. For more information look here:

http://en.wikipedia.org/wiki/Prim%27s_algorithm

Demonstrate the algorithm works by printing out every edge with weights in your graph, and then printing out the minimum spanning tree.