出版社：The Editorial Committee of the Interdisciplinary Information Sciences
摘要：For a digraph G = ( V , A ) and a source vertex s ∈ V , suppose that we wish to compute a shortest directed path from s to every vertex v ∈ V \ { s } (if exists) under several arc costs. Frigioni et al. (2000) proposed a dynamic algorithm which efficiently reuses the shortest-paths information computed for the previous arc costs. In this paper, we experimentally evaluate how such a dynamic algorithm works efficiently for real-world networks.
关键词：dynamic algorithm;graph algorithm;shortest-paths problem
