A Survey of Trilogy Shortest Path Algorithms

Authors

  • Shaista Sarwar student
  • Laiba Shaheen Student

Keywords:

Dijkstra; Shortest path; Floyd; Bellman

Abstract

Shortest path problem is one of the most classical problem in graph theory, aiming to discover the shortest path between two nodes in a graph. In this problem, we have to find the minimum-cost tracks or shortest paths between the starting node and final destination in a given graph.Thiswork gives a brief introduction of the most famous algorithms of the shortest path problem i.e. Dijkstra’s, Bellman-Ford, and Floyd Warshall algorithm. A comparative analysis of these algorithms is performed based on their advantages, disadvantages, and efficiency, and application areas.

Downloads

Published

2021-06-20