Two interactive walkthroughs of single-source shortest-path algorithms.
Step through each one node by node — edit the graph, drag nodes,
and watch how each algorithm decides. Dijkstra is greedy and
needs non-negative weights; Bellman-Ford is slower but handles
negative edges and detects negative cycles.