On the Routing Problems of Navigation System
碩士 === 國立交通大學 === 資訊科學與工程研究所 === 97 === The shortest path problem has been studied for decades, and many efficient algorithms based on Dijkstra's algorithm have been developed. In this thesis, we focus on the road network graphs. Priority queue is an important data structure used in Dijkstra�...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2009
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/62018514333145122807 |