R Observatory: Metrics for cppRouting version 3.2

Balamuta, James Joseph

doi:10.5281/zenodo.21843040

cppRouting

3.2Package record

Algorithms for Routing and Solving the Traffic Assignment Problem

6packages depend

11.8Kdownloads / year

–test coverage

11/13flavors OK

Overview

About

Maintained by Vincent LarmetCRAN page ↗GitHub ↗

Calculation of distances, shortest paths and isochrones on weighted graphs using several variants of Dijkstra algorithm. Proposed algorithms are unidirectional Dijkstra (Dijkstra, E. W. (1959) doi:10.1007/BF01386390), bidirectional Dijkstra (Goldberg, Andrew & Fonseca F. Werneck, Renato (2005) https://www.cs.princeton.edu/courses/archive/spr06/cos423/Handouts/EPP%20shortest%20path%20algorithms.pdf), A* search (P. E. Hart, N. J. Nilsson et B. Raphael (1968) doi:10.1109/TSSC.1968.300136), new bidirectional A* (Pijls & Post (2009) https://repub.eur.nl/pub/16100/ei2009-10.pdf), Contraction hierarchies (R. Geisberger, P. Sanders, D. Schultes and D. Delling (2008) doi:10.1007/978-3-540-68552-4_24), PHAST (D. Delling, A.Goldberg, A. Nowatzyk, R. Werneck (2011) doi:10.1016/j.jpdc.2012.02.007). Algorithms for solving the traffic assignment problem are All-or-Nothing assignment, Method of Successive Averages, Frank-Wolfe algorithm (M. Fukushima (1984) doi:10.1016/0191-2615(84)90029-8), Conjugate and Bi-Conjugate Frank-Wolfe algorithms (M. Mitradjieva, P. O. Lindberg (2012) doi:10.1287/trsc.1120.0409), Algorithm-B (R. B. Dial (2006) doi:10.1016/j.trb.2006.02.008).

Changes in 3.2

update DESCRIPTION file : remove c++11 specification and add Authors@R field

From NEWS.md in the release

Install

R (CRAN)pak (dev)Ubuntu (r2u)Fedora (COPR)openSUSE (OBS)

install.packages("cppRouting", repos = "https://cloud.r-project.org/")

Installs the current CRAN release. Prebuilt binaries on Windows and macOS.

if (!requireNamespace("pak", quietly = TRUE))
  install.packages("pak", repos = "https://cloud.r-project.org/")
pak::pak("vlarmet/cppRouting")

Development version from vlarmet/cppRouting. Installs pak first if it is not already available.

Release

# enable cranapt (r2u) if it is not already set up, then install
grep -rqs r2u.stat.illinois.edu /etc/apt/sources.list /etc/apt/sources.list.d/ \
  || curl -fsSL https://raw.githubusercontent.com/eddelbuettel/r2u/master/inst/scripts/add_cranapt_noble.sh | sudo bash
sudo apt install -y r-cran-cpprouting

Fast Ubuntu binaries via r2u (no compilation). The cranapt setup runs once and is skipped when it is already enabled. We list this channel from recorded r2u download activity rather than from a live index of the repository, so treat it as last known rather than guaranteed.

bspm (used by r2u) also needs make: sudo apt install make

# enable the iucar/cran COPR if it is not already present, then install
ls /etc/yum.repos.d/*iucar*cran*.repo >/dev/null 2>&1 \
  || sudo dnf copr enable -y iucar/cran
sudo dnf install -y R-CRAN-cppRouting

RPMs from the iucar/cran COPR, rebuilt from CRAN.

For install.packages() integration in R, also: sudo dnf install R-CoprManager

# add the autoCRAN OBS repo (Tumbleweed) if it is missing, then install
zypper -q lr | grep -qi autoCRAN \
  || sudo zypper addrepo https://download.opensuse.org/repositories/devel:/languages:/R:/autoCRAN/openSUSE_Tumbleweed/devel:languages:R:autoCRAN.repo
sudo zypper install -y R-cppRouting

RPMs auto-built from CRAN on openSUSE OBS (Tumbleweed). We list this channel from recorded autoCRAN download activity rather than from a live index of the repository, so treat it as last known rather than guaranteed.

Health

CRAN checks

2NOTE11OK

Check messages

NOTEdependencies in R coder-devel-linux-x86_64-fedora-clang, r-devel-linux-x86_64-fedora-gcc

Namespace in Imports field not imported from:
  ‘RcppProgress’
All declared Imports should be used.

CRAN check page ↗

Slowest check: 5.1 min · r-devel-windows-x86_64

Status changes

NOTE11 OK, 2 NOTENow
NOTE9 OK, 5 NOTE2026-04-22
ERROR8 OK, 5 NOTE, 1 ERROR2026-04-18
NOTE9 OK, 5 NOTE2026-04-10
ERROR8 OK, 5 NOTE, 1 ERROR2026-04-09
NOTE9 OK, 5 NOTE2026-03-10

Advisories

none known

How this is measured·How advisories are found

Documentation

In release 3.2

README· In the repository, left out of the releaseVignettesYes · 1 · dynamicNEWSYes · 33% structured · mentions 3.2Citation fileNoWebsitenot declared in DESCRIPTION

Help pages: 12
Examples that run: 100%12 run in a plain check
Exported functions with examples: 100%
Documented parameters: 100%
Return-value docs: 100%
Help pages citing references: 8%

Vignettes (1)

cppRouting HTML

How these are measured

Downloads

11.8K

CRAN downloads in the past year

Rank #4,254 · ~32/day · ~984/mo

Releases R versions

Daily download trend is not available in this view yet.

77330 days

2K90 days

11.8K1 year

Compare downloads with other packages →

Also on518 r2u22 autocran1.7K conda_forge

How downloads are counted

Repository

vlarmet/cpprouting ↗Account: vlarmet

122Stars

11Forks

11Open issues

0Open PRs

4Releases

170Commits

2Commit identities

rdijkstra-algorithmisochronesshortest-pathsparallel-computingrcppc-plus-plusdistance

170 commits · Last activity 2026-07-22 · 0% stars, 30d · Default branch at 4.0, ahead of CRAN 3.2 (checked 2026-10-11)

Responsiveness

How these are sampled

PRs merged (all time): 25%
Median days to close, 50 most recently updated closed issues: 3
Median days to close, 50 most recently updated closed PRs: 2

Stars over time

2025-06-09 · 1132026-09-14 · 122

How these are measured

PracticesBeta

2 development-tooling and community-health practices detected across 1 family in the upstream repository

Checks run against github.com/vlarmet/cpprouting on 2026-10-11.

Continuous integration (2)

GitHub ActionsR CMD check workflow

The R CMD check workflow runs on Linux, macOS and Windows, and on R-devel

How this is detected·Detection ruleset v3 (2026-09-26)

Dependencies

Declared dependencies

10 external dependencies (excludes base and recommended)

Installing cppRouting adds 4 packages (3 with compiled code, 8.2 MB of source tarballs). Heaviest: data.table 5.7 MB, Rcpp 1.8 MB, RcppParallel 744 KB.

Depends (0)

none

Imports (4)

Rcpp RcppParallel RcppProgress data.table

LinkingTo (3)

Rcpp RcppParallel RcppProgress

Suggests (3)

knitr rmarkdown igraph

Enhances (0)

none

Dependency license breakdown →

Reverse dependencies

6direct

1indirect

Imports 6

Depends, Imports or LinkingTo, most downloaded first

spNetwork spanner himach GISSB uci havel

How these are counted

Code & Tests

People & History

People (1)

Vincent Larmet

Author, Maintainer since 1.1 (2019)

Releases (6)

Pick two releases to compare their code metrics.

R
R 4.6.0 released · 2026-04-24
3.2Latest
record
2025-11-28 · current release · diff ↗
R
R 4.5.0 released · 2025-04-11
R
R 4.4.0 released · 2024-04-24
R
R 4.3.0 released · 2023-04-21
3.1
record
2022-12-01 · diff ↗
3.0
record
2022-11-28 · diff ↗ ·
added 2 exports
assign_traffic, get_aon
R
R 4.2.0 released · 2022-04-22
R
R 4.1.0 released · 2021-05-18
R
R 4.0.0 released · 2020-04-24
2.0
record
2020-01-07 · diff ↗ ·
added 1 export
cpp_contract
1.2
record
2019-09-30 · diff ↗ ·
added 3 exports
to_df, cpp_simplify, get_detour
1.1
record
2019-06-21
R
R 3.6.0 released · 2019-04-26

Package metadata

First published: 2019-06-21
Total releases: 6 / 7 yrs
License: GPL (>= 2) OSI
Download size: 66 KB

Cite

Cite this package

Run in R for the authors' preferred citation:

citation("cppRouting")

Format

Larmet, V. (2025). cppRouting: Algorithms for Routing and Solving the Traffic Assignment Problem (Version 3.2) [Computer software]. https://doi.org/10.32614/CRAN.package.cppRouting

This package has no citation file, so citation() returns this entry built from DESCRIPTION.

Cite the R Observatory

For a number measured here: a download total, a coverage figure, an archival date.

Format

APA

Balamuta, J. J. (2026). R Observatory: Metrics for cppRouting version 3.2 [Data set]. HJJB, LLC. Data release v2026-10-18. https://doi.org/10.5281/zenodo.21843040

From data release v2026-10-18, which the citation names so these numbers can be found later. More on citing and the projects behind them.

Report a problem with this page →