Send data packets through a network and see shortest-path routing adapt to congestion and link capacity.
Packets use Dijkstra’s shortest-path algorithm. Link costs rise with congestion, so newly routed packets can choose less busy paths.