The assignment problem: give each of n workers one of n jobs at the least total cost, with the Hungarian algorithm, its potentials and its tight edges.
This interactive visualization needs JavaScript.