The complex network can describe the topology of complex system, and the topology of complex network can affect the coupling among the activities of network node. Based on the topology of complex network, the concepts of Degree of Network Relation Coupling (DNRC) are defined by using the paths of network. In order to resolve the paths of complex network, the linear planning model is constructed firstly in this paper. At the same time, the Dijkstra algorithm for resolving the shortest path of the network which has positive weight is discussed. Then, we present a method which can transfer non-weight complex network to positive weight network. We also discuss how to resolve the entire shortest path between any two nodes. Based on the sort order of all paths between any two nodes in complex network, we also discuss how to resolve the second shortest path or more length paths in complex network. At last, some conclusions are presented in this paper.
展开▼
