Finally, a Fast Algorithm for Shortest Paths on Negative Graphs | Quanta Magazine

Researchers can now find the shortest route through a network nearly as fast as theoretically possible, even when some steps can cancel out others.
Read more at Quanta Magazine…