Dijkstra's algorithm has long been the quickest way of finding the shortest possible paths in a network, but researchers have discovered an even faster method.