Prim MST algorithim

Last major task for this sprint, implement an algorithm to find the minimum spanning tree of a graph. Its possible I could make them an entire class as well, with features like a reference to the graph they are a spanning tree of, and using the same objects as that tree for its nodes - but i would need to consider if this is in accordance with principles first 