网络分层用于最短路问题的算法研究  

Research on application of network-delaminating in shortest path problem

作　　者：付江缺[1] 高井祥[1] 段春燕[2] 孙正明[1] 

机构地区：[1]中国矿业大学环境与测绘学院,江苏徐州221008 [2]中国矿业大学理学院,江苏徐州221008

出　　处：《测绘科学》2009年第3期109-110,共2页Science of Surveying and Mapping

摘　　要：提出了一种基于Dijkstra方法的网络分层算法,实现了两点间节点数最少条件下最短通路的求取,并与传统Dijkstra算法进行了比较,得到了一些有益的结论。Method of network-delameinating based on dijkstra is proposed in this paper and problem of shortest path between two targets with minimal nodes is successfully resolved. Some useful conclusions were obtained by comparison with traditional dijkstra algorithm.

关 键 词：邻接矩阵 最短网络层 DIJKSTRA算法 

分 类 号：P282[天文地球—地图制图学与地理信息工程]