Interactive application
Interactive
Overview · selected highlights
Graph algorithms
Inspect the working state behind a graph result. Lazy and eager Prim expose different queue bookkeeping, SPFA reveals its changing frontier, and Floyd–Warshall retains path witnesses. Assumptions, updates and counterexamples explain subtleties that a final highlighted graph would hide.
VisitRelaxConnect
- ⌘
Set the graph
Choose topology and weights that make the algorithm's assumptions concrete.
- →
Follow the frontier
Inspect queues, candidate edges and intermediate distance updates.
- Δ
Compare implementations
See how different bookkeeping changes the work on the same problem.
- ⇒
Connect to the proof
Use witnesses and invariants to explain why the result is valid.
The working state explains the algorithm; Clique Proofs explores the arguments behind it.
