This repository contains an implementation of Prim's algorithm, a widely-used greedy algorithm for finding the Minimum Spanning Tree (MST) in a graph. Prim's algorithm is particularly useful for ...

Implement Prim’s Minimum Cost Spanning Tree algorithm, MST, using a simple data structure and fibonacci heap, called heap scheme, and measure the relative performance of the two implementations. Both ...