Research on application of network-delaminating in shortest path problem

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.