This paper presents a distributed synchronous algorithm for constructing the Minimum-Weight Spanning Tree (MST) in a connected undirected graph with distinct edge weights. Each node in the graph is considered as a processor having the initial knowledge of weights of…