Internet Routing: Distance-Vector vs Link-State (2D)

This 2D companion runs the real Bellman-Ford distance-vector algorithm and Dijkstra's link-state algorithm — the mechanics behind RIP and OSPF — over the same editable weighted graph, drawn with a plain top-down Canvas 2D view built for reading the protocol behaviour rather than a 3D scene: pick an algorithm, a source and destination, load a topology preset, cut a link mid-convergence and step or auto-run to watch Distance-Vector's round-by-round table exchange (including the count-to-infinity failure mode) against Link-State's one-shot flood-and-Dijkstra convergence.