For decades, computer scientists working on negative-weight graphs tried to match the speed of Dijkstra’s algorithm with similar “combinatorial” algorithms. These involve discrete operations — like ...