algorithms.tutorialhorizon.com
Introduction to Minimum Spanning Tree (MST) | Algorithms
A minimum spanning tree (MST) or minimum weight spanning tree is a subset of the edges of a connected, edge-weighted (un)directed graph that connects all the vertices together, without any cycles and with the minimum possible total edge weight.