Calculating the shortest path between two locations in a road network is a significant problem in network analysis. Roads play a pivotal role in day to day activities of masses live in places and areas. They travel for various purposes that are, to study, to work, to shop and to supply their goods and the like, from one place to another place. Even in this modern era, roads remain one of the mediums used most frequently for travel and transportation. Being ignorant of the shortest routes people sometimes have to travel long distances, consume extra precious time, money and bare undesirable mental stress. Karachi is the second most populated and the seventh biggest city of the world. It is the central place of Pakistan, which is famous for industry, banking, trade and economic activity, and there are places which frequently visit by the inhabitants for their miscellaneous requirements. Federal Board of Revenue (FBR) is one of the departments that deal with taxation and revenue generation in the country. A common man residing near or distant areas often visit FBR to settle their business / property and tax related issues. In order to facilitate the masses, an effort is being made to develop a prototype based on Dijkstra’s Algorithm (DA) to establish a shortest route, that will help individuals in navigation and subsequently alleviate difficulties faced by them in travelling/ road networks.