Abstract:

The monophyletic Dijkstra shortest path algorithm was analyzed based on GIS(Geographic Information System) platform. A balanced community analysis network segmentation method was proposed, the road network was divided and degraded into balanced community network based on GIS, and the limited layering algorithm was used. Nodes that are unlikely to appear on the optimal path was eliminated to limit the search area and the purpose of reducing the complexity of algorithm is achieved. The experiments show that the optimized results can effectively reduce the number of searching nodes, compared with the classic algorithms, the efficiency is improved.

Key words: community segmentation algorithm, limit layered algorithm, geographic information system(GIS);
shortest path algorithm