Shortest path problem
piero at innova.it
Fri Oct 15 04:45:45 EDT 1999
I would like to have a new function in mapserv (or as a separate cgi
application) for finding the shortest path between two given points in a city
Does anyone have suggestions - either theoretical or practical - on a
possible approach to this matter?
For example, is Dijkstra's algorithm applicable and suitable to this goal or
are there better ways to accomplish it?
Thanks in advance for your opinions.
More information about the mapserver-users