Bellman-Ford animated: relax every edge V−1 rounds, watch distances converge, and see why a further improvement would prove a negative cycle.
Tip: use samples, upload, copy, download, and send-to actions inside the workspace where available.
Bellman-Ford Visualizer is a free, browser-based tool that helps you turn raw numbers into clear charts. Bellman-Ford animated: relax every edge V−1 rounds, watch distances converge, and see why a further improvement would prove a negative cycle. It's built for speed and privacy: Everything runs locally in your browser — your data is never uploaded to a server. No sign-up, no installs, and no daily limits.
Visualize the dataset after it has been cleaned enough for reliable labels and numeric values.
Review the preview, copy or download the result, and keep everything local in your browser.
Dijkstra's Algorithm Visualizer: Dijkstra's shortest path animated: settle the closest node, relax its edges, watch distances improve — with a live distance table and pseudocode.
Open toolFloyd-Warshall Visualizer: Floyd-Warshall animated: the all-pairs distance matrix updates as each node is allowed as a stopover — every improving triple shown in the table.
Open toolAlgorithm Academy: 35+ classic algorithms animated step by step — searching, counting/radix/bucket sort, dynamic programming tables, greedy, backtracking, KMP, graph algorithms, max flow, and convex hull — with auto-play, next/prev stepping, adjustable interval, and pseudocode that highlights the running line.
Open toolA:0 B:∞ C:∞ D:∞ E:∞ F:∞
1Bellman-Ford from A: relax EVERY edge, V−1 = 5 times. Slower than Dijkstra but handles negative weights and detects negative cycles.
dist[start] = 0, rest ∞repeat V-1 times:relax EVERY edge (u,v,w)round k fixes paths of ≤ k edgesstop early if nothing changedone more pass improves ⇒ negative cycle
Shortest paths that tolerate negative edge weights: relax every edge V−1 times. A further improving pass would prove a negative cycle.
