Performance Analysis of Floyd Warshall Algorithm vs Rectangular Algorithm

Abstract

In this paper, we have examined the comparative study of Floyd Warshall algorithm and the Rectangular algorithm. We have tested these two algorithms on random graphs generated by the Erdös-Renyi (ER) model. The evaluation of the algorithms for different probabilities show that the Floyd Warshall algorithm gives slightly better performance for dense graphs while the Rectangular algorithm works better for sparse graphs. Keywords Bellman ford algorithm, Dijkstra's algorithm, Floyd warshall algorithm, all pair shortest path algorithm, the rectangular algorithm, comparison of algorithms.