A new technique breaks Dijkstra's 70-year-old record: it finds routes faster in huge networks, changing graph theory forever.

Hu and Torres have proposed a decomposition algorithm for finding the shortest paths between all pairs of nodes in a sparse network in which subnetworks are linearly overlapped. The purpose of this ...