New algorithm for Degree of Network Relation Coupling in complex networks

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 nodes. 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 in this paper, and the Dijkstra algorithm is discussed to address the shortest path of the network which has positive weight. Then, we present a method which can transfer non-weight complex network to positive weight network. Next, we explain 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.