September 2015
Intermediate to advanced
320 pages
12h 30m
English
CHAPTER 9
![]()
From A to B with Edsger and Friends
The shortest distance between two points is under construction.
— Noelie Altito
It’s time to return to the second problem from the introduction:1 How do you find the shortest route from Kashgar to Ningbo? If you pose this problem to any map software, you’d probably get the answer in less than a second. By now, this probably seems less mysterious than it (maybe) did initially, and you even have tools that could help you write such a program. You know that BFS would find the shortest path if all stretches of road had the same length, and you could use the DAG shortest path algorithm as long as you ...