Abstract
In this paper we review the algorithms available for computing shortest paths in large sparse graphs with non-negative weights. We then present the results of a study comparing efficient PC-based implementations, executed on large road-like networks. Some algorithms are up to 218 times faster than Dijkstra's classical algorithm when run on graphs with 15000 nodes.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
