Shortest Path Queries in Very Large Spatial Databases
Finding the shortest paths in a graph has been studied for a long time, and there are many main memory based algorithms dealing with this problem. Among these, Dijkstra's shortest path algorithm is one of the most commonly used efficient algorithms to the non-negative graphs. Even more effi...
| Main Author: | |
|---|---|
| Language: | en |
| Published: |
University of Waterloo
2006
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10012/1156 |