A Method of Finding the Shortest Path of Dynamic Networks

Authors

Lunwen Wang, 1.Electronic Countermeasure Institute of National University of Defense Technology, Hefei 230037, China; ;
Zhang Ling, 2.Department of Computer Science and Technology, Anhui University, Hefei 230039, China;

Abstract

Abstract: We analyze the research status of finding the shortest path of dynamic networks, analyze the complexity of getting the shortest path, study the relationship between the structure of the dynamic networks and finding the shortest path of the dynamic networks. It is proved that dynamic networks defined by velocity automatically meet weak FIFO’s condition. The networks whose passing function of any side is not decreasing function equals dynamic networks which use velocity. The sufficient condition of directly using Dijkstra algorithm to get the shortest path is that the networks must meet weak FIFO’s condition. How to build a dynamic network which can automatically meet FIFO’s condition or meet FIFO’s equivalent condition is studied, and an algorithm of getting the shortest path of the dynamic networks is given. An example is given to explain the validity of our methods.

Recommended Citation

Wang, Lunwen and Ling, Zhang (2019) "A Method of Finding the Shortest Path of Dynamic Networks," Journal of System Simulation: Vol. 30: Iss. 3, Article 52.
DOI: 10.16182/j.issn1004731x.joss.201803052
Available at: https://dc-china-simulation.researchcommons.org/journal/vol30/iss3/52

First Page

1189

DOI Link

https://doi.org/10.16182/j.issn1004731x.joss.201803052

Last Page

1194

CLC

TP18

Recommended Citation

Wang Lunwen, Zhang Ling. A Method of Finding the Shortest Path of Dynamic Networks[J]. Journal of System Simulation, 2018, 30(3): 1189-1194.

DOI

10.16182/j.issn1004731x.joss.201803052