Prim’s Algorithm is a greedy algorithm used to find the Minimum Spanning Tree (MST) of a connected, weighted graph.[1] The Minimum Spanning Tree (MST) problem asks: what is the cheapest way to connect ...
This project investigates the parallelization of Prim's algorithm for computing the Minimum Spanning Tree (MST) of a connected, undirected, and weighted graph. Three implementations are provided and ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results