The approach to the shortest path algorithms with restrictive conditions
Yong Zheng Zhou · Fuzhou daxue xuebao. Ziran kexue ban · 2004
In this article, a Dijkstra algorithm with restritive conditions is proposed in GIS environment on the basis of binary-heap priority queue and adjacent list. It can find a shortest path on search graph according to start node, goal node, avoidable and passing node array given by user. Finally, this algorithm is implemented by Java language.