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 ...
This project provides a massively parallel implementation of a Minimum Spanning Tree (MST) graph algorithm using NVIDIA CUDA. The implementation is based on Borůvka's algorithm, which is highly ...
Abstract: The minimum spanning tree (MST) problem has numerous applications in design of communication, computer and transportation networks. This paper proposes an application of a new meta-heuristic ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results