Calculation of distances, shortest paths and isochrones on weighted graphs using several variants of Dijkstra algorithm. Proposed algorithms are unidirectional Dijkstra (Dijkstra, E. W. (1959) <doi:10.1007/BF01386390>), bidirectional Dijkstra (Goldberg, Andrew & Fonseca F. Werneck, Renato (2005) <https://pdfs.semanticscholar.org/0761/18dfbe1d5a220f6ac59b4de4ad07b50283ac.pdf>), A* search (P. E. Hart, N. J. Nilsson et B. Raphael (1968) <doi:10.1109/TSSC.1968.300136>), new bidirectional A* (Pijls & Post (2009) <http://repub.eur.nl/pub/16100/ei2009-10.pdf>).
https://anaconda.org/r_test/r-cpprouting/badges/version.svg
https://anaconda.org/r_test/r-cpprouting/badges/latest_release_date.svg
https://anaconda.org/r_test/r-cpprouting/badges/latest_release_relative_date.svg
https://anaconda.org/r_test/r-cpprouting/badges/platforms.svg
https://anaconda.org/r_test/r-cpprouting/badges/license.svg
https://anaconda.org/r_test/r-cpprouting/badges/downloads.svg