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