Fast Implementation of Dijkstra Algorithm

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) ), 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) ), new bidirectional A* (Pijls & Post (2009) < http://repub.eur.nl/pub/16100/ei2009-10.pdf>).


News

Reference manual

It appears you don't have a PDF plugin for this browser. You can click here to download the reference manual.

install.packages("cppRouting")

1.1 by Vincent Larmet, 3 months ago


https://github.com/vlarmet/cppRouting


Browse source code at https://github.com/cran/cppRouting


Authors: Vincent Larmet


Documentation:   PDF Manual  


GPL (>= 2) license


Imports Rcpp, parallel

Suggests knitr, rmarkdown, igraph

Linking to Rcpp

System requirements: GNU make, C++11


See at CRAN