cppRouting-package {cppRouting}R Documentation

Fast Implementation of Dijkstra Algorithm in R

Description

Calculation of distances, shortest paths and isochrones on non-negative weighted graphs using several variants of Dijkstra algorithm.

Functions

Algorithms

Algorithms can be chosen for one-to-one calculations like get_distance_pair() and get_path_pair() :

References

Dijkstra, E. W. (1959), A note on two problems in connexion with graphs.

P. E. Hart, N. J. Nilsson et B. Raphael (1968). A Formal Basis for the Heuristic Determination of Minimum Cost Paths.

Goldberg, Andrew & Fonseca F. Werneck, Renato (2005). Computing Point-to-Point Shortest Paths from External Memory.

Pijls & Post (2009). Yet another bidirectional algorithm for shortest paths.


[Package cppRouting version 1.1 Index]