Distributed minimum spanning tree

A distributed minimum spanning tree is like a puzzle. Imagine each computer on a network is a piece of the puzzle. All of the pieces fit together to create a tree. The pieces of the tree are connected so the computers can talk and exchange information. The tree is the most efficient way of connecting the computers in the network because it is the shortest path from one computer to another. The pieces of the tree are arranged in the most efficient way possible so that the network runs as quickly as possible and uses up the least amount of energy.