This Python program uses Prim's Algorithm to build a minimum spanning tree out of a collection of points in a Cartesian plane. A priority queue, in particular a binary min heap, is filled with the ...

This project is made to time both the Kruskals and Prims algorithm and then visualize data with varying number of nodes and density. The density is calculated by dividing the number of edges in the ...