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.

The paper considers a project scheduling problem in weighted directed graphs in which arcs represent operations while nodes are identified with starting and finishing endpoints of the operations; arc ...