Shortest Paths as Relaxation Schedules
An interactive comparison of Bellman–Ford, Dijkstra, min-plus propagation, and max-plus critical paths.
Each artifact here is a self-contained static page that works offline and is independently archivable — a landing page explains the idea, and a full-screen explorer runs the interactive application. Filter by topic using the tags in the sidebar.
A visual comparison of Bellman–Ford, Dijkstra, min-plus propagation, and max-plus critical paths as different schedules for applying the same relaxation update — stepping from algorithm to algebra on one shared graph.
