Prim’s Algorithm is a greedy algorithm that finds a Minimum Spanning Tree (MST) for a connected weighted undirected graph. The MST connects all the vertices in the graph with the minimum total edge ...

Minimum Spanning Tree Using Prim's Algorithm This C++ program demonstrates Prim's Algorithm to find the Minimum Spanning Tree (MST) of a weighted, undirected graph. The program uses an adjacency ...

Minimum spanning tree is a classical problem in graph theory that plays a key role in a broad domain of applications. This paper proposes a minimum spanning tree algorithm using Prim’s approach ...

We consider a generalization of the classical minimum spanning tree problem called the generalized minimum spanning tree problem and denoted by GMST problem. It is known that the GMST problem belongs ...

To address this problem to some extent, this article proposes an adaptive mini-minimum spanning tree-based outlier detection (MMOD) method, which utilizes a novel distance measure by scaling the ...

The optimization of the water supply pipeline route is of great significance to the design of rural water supply projects and the reform of the rural water supply management system. In this paper, a ...