[mapserver-users] routing problem

[Kurt]

Hi,
I understand that this may not be the right place to ask these
questions. But I think there might be experts here could give me some
suggestions. Thanks in advance.

1. Is the Dijkstra's algorithm
generally used to find the shortest path between point A and B like
google maps and mapquest do. If this is not the case, what algorithms
can perform better? 
2. Are there references that detail how to
apply Dijkstra's or other algorithms on the digital data (such as Tiger
file in PostGIS). What attributes should I look into?
3. Does
multi-mode routing problem use the same algorithm? I am wondering if
there is any step-by-step guides or references that I can learn from.

Thanks again


Kurt
_________________________________________________________________
Get more out of the Web. Learn 10 hidden secrets of Windows Live.
http://windowslive.com/connect/post/jamiethomson.spaces.live.com-Blog-cns!550F681DAD532637!5295.entry?ocid=TXT_TAGLM_WL_domore_092008
-------------- next part --------------
An HTML attachment was scrubbed...
URL: http://lists.osgeo.org/pipermail/mapserver-users/attachments/20081008/837fc983/attachment.html