国产欧美精品一区二区,中文字幕专区在线亚洲,国产精品美女网站在线观看,艾秋果冻传媒2021精品,在线免费一区二区,久久久久久青草大香综合精品,日韩美aaa特级毛片,欧美成人精品午夜免费影视

Using the static Dijkstra algorithm to recalculate the shortest path tree (SPT) will cause redundant computation when the network topology changes. In order to reduce the computational complexity, a dynamic Dijkstra algorithm for undirected networks is proposed based on the existing dynamic Dijkstra algorithm. The problem of how to determine the nodes to be updated in the undirected network is solved. The algorithm describes the processing method of the increase and decrease of the weight. And the existing algorithms are optimized. In order to verify the correctness of the algorithm, which is implemented by code and compared with its static algorithm. Experimental results show that the new algorithm has more performance.