A Unified Proof for Finding a Minimal Spanning Tree

Abstract

Finding a minimal spanning tree (MST) has attracted a lot of researchers. There are many approaches and ways to find a MST of a network. In this article, we demonstrate a systematic approach based on natural induction over the set of nodes to reach a final MST. The approach is to label the given network and find a MST of it by growing trees based on the induction of labelled nodes.