The Shortest Path
This video presents the same text shown beside it, spoken and on screen. It adds nothing the text does not say.
State
The shortest path problem asks for the lowest-cost way to travel from one vertex to another — a problem with efficient deterministic algorithms, solved billions of times a day.
Show
Every map route request between two pins is one more instance answered.
Watch for
The problem's easy shape hides a hard twin.