Learn

Interactive visualizations of the algorithms and concepts behind Dantzig's solvers. Step through each algorithm to see how it works.

Algorithms

Find the shortest path in a weighted graph using a priority queue.

Find the shortest tour visiting all cities — nearest neighbor + 2-opt improvement.

Pack items to maximize value within capacity — watch the DP table fill cell by cell.

Pack items into fixed-capacity bins using First Fit Decreasing heuristic.

Find the maximum flow through a network using Edmonds-Karp (BFS Ford-Fulkerson).

Interactive map of P, NP, PSPACE, EXPTIME and 20+ classified problems.

When should you stop searching and commit? Explore the 1/e rule and its variants with refusal, recall, and time-discounting.