| Article ID: | iaor20023431 |
| Country: | China |
| Volume: | 22 |
| Issue: | 2 |
| Start Page Number: | 139 |
| End Page Number: | 142 |
| Publication Date: | Apr 2001 |
| Journal: | Journal of Huaqiao University |
| Authors: | Fu Dongmian |
| Keywords: | programming: linear, queues: applications |
A study is made on the algorithm of shortest path in traffic line. By applying the idea of scope first search in graph theory, the author demonstrates the way of get in and out of the queue in a priority queue and offers an effective new algorithm of shortest path. This concise algorithm is confirmed by practical application to be fast in operation and good in effect.