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 ...

Prim’s algorithm is also a Greedy algorithm. It starts with an empty Spanning Tree. The idea is to maintain two sets of vertices. The first set contains the vertices already included in the MST, the ...