Exact travelling-salesman solving animated: partial tours extend depth-first while the bound prunes any branch that can't beat the best tour found.
Tip: use samples, upload, copy, download, and send-to actions inside the workspace where available.
TSP Branch & Bound Visualizer is a free, browser-based tool that helps you turn raw numbers into clear charts. Exact travelling-salesman solving animated: partial tours extend depth-first while the bound prunes any branch that can't beat the best tour found. 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.
Knapsack Branch & Bound Visualizer: 0/1 knapsack solved exactly with a fractional-relaxation bound — watch whole subtrees die the moment their optimistic bound can't beat the best.
Open toolHamiltonian Cycle Visualizer: Backtracking search for a cycle through every node exactly once — extensions, dead ends, and the NP-complete reality animated on a real graph.
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 toolbest: ∞
1TSP by branch & bound over 5 cities: explore partial tours, but PRUNE any branch whose cost already exceeds the best complete tour found so far.
best = ∞extend(tour, cost):full tour → close it, update bestcomplete tour cheaper → NEW BESTpartial cost ≥ best → PRUNE subtreeoptimal when the tree is exhausted
Explore partial tours depth-first, but abandon any branch whose cost already meets the best full tour — exact answers without visiting the whole factorial tree.
