As predicted, I did not have much time to talk about the three
algorithms at end of Notes.txt, but I did at least give the "Atlanta
to Boston" example, where we could expect A* to visit many fewer
points than Dijkstra, to find the same shortest path.