Abstract

The Dijkstra’s algorithm [1] is applied on many real world network problems like mobile routing, road maps, railway networks, etc,. There are many techniques available to speedup the algorithm while guaranteeing the optimality of the solution. The main focus of this work is to implement the combined speedup technique which is based on containers and arc flags(COCA). The technique is experimented with two different types of LEDA generated graphs namely random graphs, planar graphs and road networks. The performance metric speedup was measured with respect to runtime of the technique and vertex visited during shortest path computation. The COCA technique proves to give best results in planar graphs. Road networks can be effectively processed with shortest path containers

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.