 Expected linear time MST algorithm

The Expected Linear Time Minimum Spanning Tree (MST) algorithm is a type of randomized algorithm that constructs a minimum spanning tree for a given connected, weighted graph in expected linear time. The most notable of these algorithms is due to a technique based on random sampling or randomized method, which uses probability to improve the efficiency of MST construction.