The simplex method is walking along edges

A linear program’s feasible set is a polytope, and an optimum sits at a vertex. Each pivot moves to a neighboring vertex with a better objective value.

Reading the tableau as geometry made degeneracy make sense: several bases describe the same vertex, so a pivot can change the basis without moving at all.