More on shortest map routes
July 15, 2007
In a previous blog I discussed Dijstra's algorithm and its application to finding shortest auto routes (see "Greedy is good (sometimes)" from last May).
One of the problems with this algorithm or recipe is that it can take a long time to run since distance computations have to be made for each pair of "nodes" or intersections of routes... continued »