Work

Spanning Tree and Minimum Spanning Tree in Warshall and Dijkstra Algorithm

Year: 2025

Type: article

Abstract: This research explores the mathematical underpinnings of spanning trees and minimum spanning trees. I present the mathematical properties of spanning trees and utilize Kirchhoff’s matrix tree theorem to calculate the total number of possible spanning trees. Moreover, discussion about the properties of minimum spanning trees and compare the performance of Warshall’s, Dijkstra’s and Kruskal’s methods for finding minimum spanning trees.

Source: Zenodo (CERN European Organization for Nuclear Research)

DOI: 10.5281/zenodo.15124083

Authors: S. Yoga, K. Maheswari, S. Selvapriya, V. Yuvashree

Language: English

Topic: Complexity and Algorithms in Graphs

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W6911949869

FWCI:

Cites:

Cited by:

Related to: