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

Research on application of network-delaminating in shortest path problem

提出了一种基于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.