You are currently viewing an archived version of Topic .
If updates or revisions have been published you can find them at .
Author and Citation Info:
DiBiase, D., DeMers, M., Johnson, A., Kemp, K., Luck, A. T., Plewe, B., and Wentz, E. (2006). Least-cost (shortest) path. The Geographic Information Science & Technology Body of Knowledge. Washington, DC: Association of American Geographers. (2nd Quarter 2016, first digital).
Learning Objectives:
Describe some variants of Dijkstra’s algorithm that are even more efficient
Discuss the difference of implementing Dijkstra’s algorithm in raster and vector modes
Demonstrate how K-shortest path algorithms can be implemented to find many efficient alternate paths across the network
Compute the optimum path between two points through a network with Dijkstra’s algorithm
Explain how a leading World Wide Web-based routing system works (e.g., MapQuest, Yahoo Maps, Google)
You are currently viewing an archived version of Topic . If updates or revisions have been published you can find them at .
DiBiase, D., DeMers, M., Johnson, A., Kemp, K., Luck, A. T., Plewe, B., and Wentz, E. (2006). Least-cost (shortest) path. The Geographic Information Science & Technology Body of Knowledge. Washington, DC: Association of American Geographers. (2nd Quarter 2016, first digital).