Incremental computation of shortest paths in semi-dynamic graphs using software components

Abstract

Communication and transportation network topologies routinely change due to link failures and link recovery or due to road construction and blockage. Therefore, the graphs representing these networks are dynamic in nature, i.e., they evolve over time due to edge insertion or deletion. To facilitate computation of shortest paths in dynamic graphs, this paper proposes an object-based software concept with a flexible, incremental interface and outlines its formal specification of behavior. Using this interface, a caller can switch back and forth between the edge insertion and shortest paths computation phases, adding edges, one at a time. Alternative components that implement the interface might amortize and optimize computation of shortest paths in changing graphs and provide interesting performance trade-offs.