Learn
Interactive visualizations of the algorithms and concepts behind Dantzig's solvers. Step through each algorithm to see how it works.
Algorithms
Dijkstra's Shortest Path
O((V+E) log V)Find the shortest path in a weighted graph using a priority queue.
Travelling Salesman (TSP)
NP-hardFind the shortest tour visiting all cities — nearest neighbor + 2-opt improvement.
0-1 Knapsack
O(nW)Pack items to maximize value within capacity — watch the DP table fill cell by cell.
Bin Packing
NP-hardPack items into fixed-capacity bins using First Fit Decreasing heuristic.
Max Flow
O(VE²)Find the maximum flow through a network using Edmonds-Karp (BFS Ford-Fulkerson).