Improvement And Experimental Evaluation Bellman-Ford Algorithm
Wei Zhang, Hao Chen, Chong Wen Jiang, Lin Long Zhu · 2013
The shortest path problem is the problem of finding a path between two vertices on a graph such that sum of the weights of its constituent edges is minimized.Simulations to compare the efficiencies for Dijkstra's algorithm, SPFA algorithm and improved Bellman-Ford were taken.The result shows that Dijkstra's algorithm, SPFA algorithm have almost same efficiency on the random graphs, the improved algorithm, although the improved algorithm is not desirable, on grid maps the proposed algorithm is very efficient.The proposed algorithm has reduced two-third times processing time than SPFA algorithm.