Fast Implementation of Dijkstra Algorithm


[Up] [Top]

Documentation for package ‘cppRouting’ version 1.1

Help Pages

cppRouting Fast Implementation of Dijkstra Algorithm in R
get_distance_matrix Compute all shortest distance between origin and destination nodes.
get_distance_pair Compute shortest distance between origin and destination nodes.
get_isochrone Compute isochrones/isodistances from nodes.
get_multi_paths Compute all shortest paths between origin and destination nodes.
get_path_pair Compute shortest path between origin and destination nodes.
makegraph Construct graph