Prim's Algorithm

Algorithm that finds the Minimum Spanning Tree in a graph.

Example:

To run the example simply type python example.py.

Try modifing the flights.edgelist file and running python exampleL.py to see other graphs

Requirements:

Python 2.7
matplotlib
networkx
networkx_viewer
pqdict

GPL licence