# Algorithms for Routing and Solving the Traffic Assignment Problem

## Documentation for package ‘cppRouting’ version 3.2

- DESCRIPTION file.
- User guides, package vignettes and other documentation.
- Package NEWS.

## Help Pages

assign_traffic | Algorithms for solving the Traffic Assignment Problem (TAP).
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_aon | Given an origin-destination matrix, compute All-or-Nothing assignment.
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