This project implements Prim's algorithm to find the minimum spanning tree of a weighted graph. The problem is about connecting villages with roads at the minimum total cost. The program reads a graph ...

Minimum Spanning Tree The Parallel BGL contains four minimum spanning tree (MST) algorithms [DG98] for use on undirected, weighted, distributed graphs. The graphs need not be connected: each algorithm ...