A procedure for finding a minimum spanning tree in a network. The method selects the lowest cost arcs in sequence, while ensuring that no cycles are allowed. Ties are broken arbitrarily. For a network with n nodes, the process stops when n − 1 arcs are selected. Greedy algorithm; Minimal spanning tree; Prim's algorithm.