All apps. Free in your browser.
Dijkstra's algorithm
Shortest paths step by step: build your own weighted graph, choose a start node and follow the D/R table, the visited set and the pseudocode in sync with the node selection in the graph — navigable forward and back.
Linear problemsTry itLinear problems made visual
Understand and solve linear problems graphically — explore objective function, constraints and feasible region interactively.
Linear problemsTry itSimplex in space
The simplex algorithm on a glass body: from the starting vertex it climbs edge by edge, with pivot column, ratio test as a ray and an objective plane that moves along. Five examples (including Klee–Minty, degenerate, ambiguous), rolling new bodies, four pivot rules compared, tableau in lockstep.
Linear problemsTry itSimplex algorithm
Understand the simplex algorithm step by step — follow tableau, pivot choice and Gaussian elimination interactively.
Linear problemsTry it