> I will give an algorithm that calculates by
> recursion road distances from town 1 (it is called
> Paris, naturally) to each other town, and, in each
> town-center that is connected by road to Paris,
> plants a signpost proclaiming the road distance to
> Paris Notre-Dame (Paris' center) and indicating by
> arrows all the shortest roads.
> 
> Then, to go from any town 2 to Paris 1 by a
> shortest route, as Phil is challenging us to do,
> we just follow the signposts to Paris!

Laurent,

This won't work. If you follow the signposts to Paris, all that happens is
you get on the Peripherique, and then you're stuffed. We have the same
problem with the M25.

Anyway, don't all roads lead to Rome ?

Phil :o)