Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
