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

Computer scientists have written a network flow algorithm that computes almost as fast as is mathematically possible. This algorithm computes the maximum traffic flow with minimum transport costs for ...