Title: A modified algorithm to solve minimum spanning tree problem

Authors: Siva Prasad Behera; Prasanta Kumar Raut

Addresses: Department of Mathematics, C.V. Raman Global University, Bhubaneswar-752054, Odisha, India ' Department of Mathematics, C.V. Raman Global University, Bhubaneswar-752054, Odisha, India

Abstract: Here, we give a modified and improved algorithm to find an MST from a given weighted undirected graph. Our algorithm works in two stages. In the first stage, it finds a forest formation involving the edges with minimum weights, and in the second stage, the algorithm converts the forest obtained in the first stage into a spanning tree. Further, we demonstrate our algorithm with one example, discuss the complexity of our algorithm, give its implementation using the Java Applet program, and compare the output with Kruskal's algorithm. This study demonstrates that the suggested approach is superior to conventional algorithms for handling MST.

Keywords: array; binary heap; Kruskal's algorithm; minimum spanning tree; forest; stack.

DOI: 10.1504/IJRIS.2025.149716

International Journal of Reasoning-based Intelligent Systems, 2025 Vol.17 No.6, pp.390 - 396

Received: 25 Jul 2023
Accepted: 18 Aug 2023
Published online: 11 Nov 2025 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article