cppRouting-package {cppRouting} | R Documentation |
Calculation of distances, shortest paths and isochrones on non-negative weighted graphs using several variants of Dijkstra algorithm.
distance matrix (between all combinations origin-destination nodes),
distances between origin and destination by pair (one-to-one),
shortest paths between origin and destination by pair (one-to-one),
shortest paths between all origin nodes and all destination nodes,
Isochrones/isodistances with one or multiple breaks.
Algorithms can be chosen for one-to-one calculations like get_distance_pair() and get_path_pair() :
uni-directional Dijkstra algorithm,
bi-directional Dijkstra algorithm,
uni-directional A* algorithm (nodes coordinates are needed),
New bi-directional A* algorithm (nodes coordinates are needed).
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.