United Structure of Point-Arc for Network Graph and It's Application in GISs Shortest Path Searching
Jie Wang · 2000
Shortest path analysis is one of the basic problem of GISs network analysis. Algorithm of Dijkstra's and Floyd's are two classic methods, while, to realize them mainly depends on the “adjacency matrix of vertexes”. In this paper, starting from the view of economizing in memory space and increasing operation speed, we use the united structure of point arc to express a map, to realize the justifying and getting the shortest path automatically throuth the algorithm of depth first search. And the practicing method is also given here.