Computer Science / Unit 3 CS 0153 short lesson, about 20 seconds
The Shortest Path
Captions available
The idea
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.
In practice
Every map route request between two pins is one more instance answered.
Where people slip
The problem's easy shape hides a hard twin.
Your place on the trail
Every lesson rests on earlier ones and opens later ones. Tap any to jump.
Builds on
Unlocks
Something wrong in this lesson? Flag it · Sources for Computer Science