A Comparison between Shortest Path Algorithms Using Runtime Analysis and Negative Edges in Computer Networks

Irrespective of the network, data is transferred from source to destination in a shortest path. This work investigates about the finest among shortest path algorithms (Dijkstra’s and Bellman ford). Data collected form Dijkstra’s and Bellman ford runtime analysis done on different system configurations. Using that data, the result of the shortest path algorithms is compared using the support of runtime of Dijkstra’s and Bellman ford on different systems. Theoretical and practical implications were discussed.