Using Dijkstra and Floyd Algorithms from Graph Theory to Solve Real-World Shortest Path Problems

Abstract

This paper presents approaches for solving practical shortest path problems by modeling them as weighted graphs and applying classical graph theory algorithms, including Dijkstra’s algorithm and the Floyd algorithm. Several real-world scenarios such as selecting economical travel routes, minimizing total travel cost, and determining graph centers are analyzed.