Implementation of Minimum Spanning tree using Prim's Algorithm
An efficient code written in JAVA to implement Prim's Algorithm using the Heap Data Structure. The features of Insert and Extract the min value from the Heap structure was designed which in return helped with the execution.