####Finds the Minimum Spanning Tree (MST) in a fully connected graph
Graph implemented using linked nodes.
To run: python3 main.py
For more info on Prim's algorithm, read problem 1 from http://www-m3.ma.tum.de/foswiki/pub/MN0506/WebHome/dijkstra.pdf