← Map
Level 26
· ◆◆◆ · ~13 min
Shortest Paths and the Arbitrage in Them
Shortest Paths and the Arbitrage in Them
"Dijkstra, Bellman-Ford, and the fact that a triangular arbitrage is a negative cycle in disguise."
Dijkstra with a heapwhy negative weights break itBellman-Ford and negative cyclesthe log transform
A short lesson, then a quiz. ❤️×3 — a wrong answer costs a heart; finish with at least one left and the level is yours. Lose all three and you'll have to try again. Replay any time — XP and cleared levels are never lost.