Interactive teaching visualizations for graph algorithms implemented in JGraphT. Each page is a single self-contained HTML file with no external dependencies. Pick a topic below.
Shortest paths live
K-shortest paths, single-pair shortest path, and the all-paths enumeration prune — three side-by-side modes comparing baseline vs. optimized variants.
Yen · Eppstein ·
Bounded-pruned Yen · Dijkstra ·
A* · AllDirectedPaths +
forward pruning
Hamiltonian path live
Side-by-side comparison of exact NP solvers vs. the polynomial DAG-restricted case. Vanilla backtracking vs. the JGraphT solver (five necessary-condition prechecks, MRV ordering, reachability prune) on the same input.
Backtracking (vanilla) ·
Backtracking + connectivity / degree / cut-vertex /
bridge-tree / SCC prechecks + MRV + reachability prune ·
DAG longest-path ·
Held-Karp (subset DP) (coming)