ABSTRACT

The Dijkstra’s algorithm [1] , which is applied in many real world problems like mobile routing, road maps, railway networks, etc,. is used to find the shortest path between source and destination. There are many techniques available to speedup the algorithm while guaranteeing the optimality of the solution. The main focus of the work is to implement landmark technique and Containers separately and compare the results with random graphs and planar graphs. The combined speedup technique which is based on landmarks and containers were also experimented with random graphs and planar graphs to improve the speedup of the shortest path queries.