Prim’s MST

Finds the Minimum Spanning Tree (MST) of a graph. It starts from an arbitrary node and repeatedly adds the shortest edge connecting the tree to a node not yet in the tree. Imagine laying fiber-optic cables to connect cities with the least amount of wire.