Optimum and shortest way finder

Abstract

Finding shortest path and traffic planning in a modern congested society is an important and time consuming procedure. Finding fast algorithms for solving shortest path problems and traffic problems are therefore of great interest for all over the world. This thesis concerns finding the shortest path and at the same time the optimum path giving some relief to the traffic burden on heavily congested road networks.. . Djikstra's algorithm is used approach to this problem and few modifications are made 40 find the optimum path. - Heavily congested Colombo city limit is chosen and a user friendly simple project is created making the traveling more interesting and less time consuming giving less burden to the traffic, society and in all economy of the country.