Fast Implementation of Dijkstra Algorithm


[Up] [Top]

Documentation for package ‘cppRouting’ version 2.0

Help Pages

cppRouting Fast Implementation of Dijkstra Algorithm in R
cpp_contract Contraction hierarchies algorithm
cpp_simplify Reduce the number of edges by removing non-intersection nodes, duplicated edges and isolated loops in the graph.
get_detour Return the nodes that can be reached in a detour time set around the shortest path
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
to_df Convert cppRouting graph to data.frame