This project implements the Asynchronous GHS algorithm which produces the Minimum spanning tree as a output. It is one of the best known algorithms used real time to build a MST among a network of anonymous nodes.