Efficient Mechanism to Enhance the Performance of Dynamic Graphs
Computing shortest paths is important issue in classical graph theory. As there are several algorithms for this issue over the years they have been suggested, primarily to operate memory and/or with static graphs that restrict their usage to several current applications, which rely on graphs becoming highly dynamic. In this paper we introduce a modern effective incremental algorithm that shape shortest distances and paths in dynamic graphs for all-pairs. We test our solution experimentally on many real-world datasets and prove that it knocks the existing algorithms built to solve the same problemsignificantly.