In such cases, the fastest known shortest-path algorithm doesn’t work. For decades, fast algorithms for finding shortest paths on negative-weight graphs have remained elusive.

Researchers have devised an "absurdly fast" algorithm to solve the problem of finding the fastest flow through a network.