Optimization model of complicated network and shortest path algorithm
Pengtao Wang · Journal of tianjin University of Technology · 2006
After bringing out the classification of large complicated network to optimize network,so the network can be divided some subnetwork.Basing the case of classification to define the data structure of the node,then using improved Dijkstra algorithm and minimum spanning trees algorithm,the shortest path between two nodes in the complicated network can becalculated.