A Shortest Path Searching Algorithm of Returning Starting Past Many Places in GIS-T
Gao Zi-you · Jisuanji gongcheng · 2005
In the procedure of transportation, the user demands searching the shortest path through which he returns the starting after reaching many places without sequence. So an information base of the shortest paths between each two places is created dynamically based on GIS-T’ data. Then making use of the feature of transportation and the information base, an algorithm is given to search the shortest path.