An exploration of Dijkstra and Floyd algorithms in city traffic method

Roads play a vital role to the people live in different places from day to day life they travel to schools to work to shops and to transport their goods. Even in this modern world roads remain one of the mediums used most frequently for travel and transportation. The computation of the shortest path between different locations appears to be a key problem in the road networks. Even now the problem still persists to find the shortest path on road networks. The wide range of applications was introduced to overcome the problem by developing various shortest path algorithms. The main aim of this thesis provides the optimal decision and transport advisory procedure to the passengers. In this research to investigate Dijkstra algorithm and Floyd algorithm to establish the structure of transportation network and find the shortest path between two cities. It has formulated the optimal decision rules to analyze the time and distance parameters among two cities. It has used Dijkstra and Floyd algorithm in order to compare the performance and provide optimal solution to the passengers.