Graph Algorithms in Java: Dijkstra, Topological Sort and Union-Find (With Real Output)
Dijkstra's shortest path, Kahn's topological sort and Union-Find built in plain Java 25, then broken on purpose: stale heap entries, negative edges, int-infinity overflow, cyclic graphs, recursion depth and a classic Union-Find bug, all with captured real output.