The Shortest Path (SP) problem resembles a variety of real-world situations where one needs to find paths between origins and destinations. A generalization the SP is Dynamic (DSP) problem, which also models changes in graph at any time. When changes, DSP algorithms partially recompute while taking advantage previous computations. Although represents many real situations, it leaves out some fun...
