GitHub

vernonadrianbalingit/Minimum-Spanning-Tree-Prim-s-Algorithm-

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 ...
Microsoft

A Lattice-Structured Proof of a Minimum Spanning Tree Algorithm

In 1983, Gallager, Humblet, and Spira published a distributed algorithm for computing a minimum spanning tree. For several years, I regarded it as a benchmark problem for verifying concurrent ...
IEEE

Solving Euclidean minimal spanning tree problem using a new meta-heuristic approach: Imperialist Competitive algorithm (ICA)

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 ...
GitHub

Quilo-AD/Minimum-Spanning-Tree-Prim-s-Algorithm-

Project Title: Optimal Power Grid Connection using Prim’s MST Algorithm with Comparative Analysis of Kruskal’s Algorithm Problem Statement: The rapid expansion of electricity demand requires power ...