Spanning Tree and Minimum Spanning Tree in Warshall and Dijkstra Algorithm

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.