THE MINIMUM SPANNING TREE PROBLEM: Jarnيkʹs solution in historical and present context

This article discusses mutual relationships between solutions to some known problems. Firstly, the history of the well-known Minimum Spanning Tree Problem, including Jarnيkʹs approach to it, is briefly revisited. Secondly, the basic differences between the three classical solutions to the MST problem are discussed. Finally, algorithms solving several other graph problems, based of Jarnيkʹs approach to the solution of the MST problem, are discussed in conjunction with the properties of the Breadth-First-Search Tree and Depth-First-Search Tree.