{ "_id": "6a4a5e431e9cffeb4b8336fa", "Package": "cppRouting", "Type": "Package", "Title": "Algorithms for Routing and Solving the Traffic Assignment\nProblem", "Version": "3.2", "Date": "2025-11-28", "Authors@R": "person(given = \"Vincent\",family = \"Larmet\",role = c(\"aut\", \"cre\"),email = \"larmet.vincent@gmail.com\")", "Description": "Calculation of distances, shortest paths and isochrones on\nweighted graphs using several variants of Dijkstra algorithm.\nProposed algorithms are unidirectional Dijkstra (Dijkstra, E.\nW. (1959) ), bidirectional Dijkstra\n(Goldberg, Andrew & Fonseca F. Werneck, Renato (2005)\n),\nA* search (P. E. Hart, N. J. Nilsson et B. Raphael (1968)\n), new bidirectional A* (Pijls &\nPost (2009) ),\nContraction hierarchies (R. Geisberger, P. Sanders, D. Schultes\nand D. Delling (2008) ),\nPHAST (D. Delling, A.Goldberg, A. Nowatzyk, R. Werneck (2011)\n). Algorithms for solving the\ntraffic assignment problem are All-or-Nothing assignment,\nMethod of Successive Averages, Frank-Wolfe algorithm (M.\nFukushima (1984) ), Conjugate\nand Bi-Conjugate Frank-Wolfe algorithms (M. Mitradjieva, P. O.\nLindberg (2012) ), Algorithm-B (R.\nB. Dial (2006) ).", "License": "GPL (>= 2)", "Encoding": "UTF-8", "SystemRequirements": "GNU make", "RoxygenNote": "7.2.1", "URL": "https://github.com/vlarmet/cppRouting", "VignetteBuilder": "knitr", "NeedsCompilation": "yes", "Config/pak/sysreqs": "make zlib1g-dev", "Repository": "https://fastverse.r-universe.dev", "Date/Publication": "2025-11-28 10:25:32 UTC", "RemoteUrl": "https://github.com/vlarmet/cppRouting", "RemoteRef": "HEAD", "RemoteSha": "d3b36705e8457cfddb8d3fe3a3fc2dfd415a70cf", "Packaged": { "Date": "2026-07-05 13:31:34 UTC", "User": "root" }, "Author": "Vincent Larmet [aut, cre]", "Maintainer": "Vincent Larmet ", "_user": "fastverse", "_type": "src", "_file": "cppRouting_3.2.tar.gz", "_fileid": "https://r2.ropensci.org/f44efbef9301152a8c7d211a66771c79d928e172f4d380c16d440038c10b085a", "_filesize": 251721, "_sha256": "f44efbef9301152a8c7d211a66771c79d928e172f4d380c16d440038c10b085a", "_expires": "2026-10-13T13:38:09.000Z", "_created": "2026-07-05T13:31:34.000Z", "_published": "2026-07-05T13:38:11.335Z", "_jobs": [ { "job": 85227609957, "time": 161, "config": "linux-devel-arm64", "r": "4.7.0", "check": "NOTE", "artifact": "8092285756" }, { "job": 85227609990, "time": 159, "config": "linux-devel-x86_64", "r": "4.7.0", "check": "NOTE", "artifact": "8092285056" }, { "job": 85227609948, "time": 162, "config": "linux-release-arm64", "r": "4.6.1", "check": "NOTE", "artifact": "8092285916" }, { "job": 85227609940, "time": 205, "config": "linux-release-x86_64", "r": "4.6.1", "check": "NOTE", "artifact": "8092291444" }, { "job": 85227609960, "time": 101, "config": "macos-oldrel-arm64", "r": "4.5.3", "check": "NOTE", "artifact": "8092277518" }, { "job": 85227609952, "time": 189, "config": "macos-oldrel-x86_64", "r": "4.5.3", "check": "NOTE", "artifact": "8092289326" }, { "job": 85227609955, "time": 143, "config": "macos-release-arm64", "r": "4.6.1", "check": "NOTE", "artifact": "8092283015" }, { "job": 85227609944, "time": 321, "config": "macos-release-x86_64", "r": "4.6.1", "check": "NOTE", "artifact": "8092307085" }, { "job": 85227296606, "time": 248, "config": "source", "r": "4.6.1", "check": "OK", "artifact": "8092263988" }, { "job": 85227609917, "time": 137, "config": "wasm-release", "r": "4.6.0", "check": "OK", "artifact": "8092282337" }, { "job": 85227609959, "time": 173, "config": "windows-devel", "r": "4.7.0", "check": "NOTE", "artifact": "8092286833" }, { "job": 85227609979, "time": 156, "config": "windows-oldrel", "r": "4.5.3", "check": "NOTE", "artifact": "8092284689" }, { "job": 85227609946, "time": 195, "config": "windows-release", "r": "4.6.1", "check": "NOTE", "artifact": "8092290027" } ], "_host": "GitHub-Actions", "_buildurl": "https://github.com/r-universe/fastverse/actions/runs/28742363742", "_status": "success", "_upstream": "https://github.com/vlarmet/cppRouting", "_commit": { "id": "d3b36705e8457cfddb8d3fe3a3fc2dfd415a70cf", "author": "vlarmet ", "committer": "vlarmet ", "message": "remove all mention of c++11 + update url in description file\n", "time": 1764325532 }, "_maintainer": { "name": "Vincent Larmet", "email": "larmet.vincent@gmail.com", "login": "vlarmet", "description": "", "uuid": 48824420 }, "_distro": "resolute", "_registered": true, "_dependencies": [ { "package": "Rcpp", "role": "LinkingTo" }, { "package": "RcppParallel", "role": "LinkingTo" }, { "package": "RcppProgress", "role": "LinkingTo" }, { "package": "Rcpp", "version": ">= 1.0.7", "role": "Imports" }, { "package": "RcppParallel", "role": "Imports" }, { "package": "RcppProgress", "role": "Imports" }, { "package": "data.table", "role": "Imports" }, { "package": "knitr", "role": "Suggests" }, { "package": "rmarkdown", "role": "Suggests" }, { "package": "igraph", "role": "Suggests" } ], "_owner": "vlarmet", "_selfowned": false, "_usedby": 7, "_updates": [ { "week": "2025-48", "n": 2 } ], "_tags": [], "_topics": [ "algorithm", "algorithm-b", "bidirectional-a-star-algorithm", "c-plus-plus", "contraction-hierarchies", "dijkstra-algorithm", "distance", "frank-wolfe", "isochrones", "parallel-computing", "rcpp", "shortest-paths", "traffic-assignment", "cpp" ], "_stars": 121, "_contributors": [ { "user": "vlarmet", "count": 150, "uuid": 48824420 } ], "_userbio": { "uuid": 105517888, "type": "organization", "name": "fastverse", "followers": 28, "description": "An Extensible Suite of High-Performance and Low-Dependency Packages for Statistical Computing and Data Manipulation in R" }, "_downloads": { "count": 820, "source": "https://cranlogs.r-pkg.org/downloads/total/last-month/cppRouting" }, "_devurl": "https://github.com/vlarmet/cpprouting", "_searchresults": 76, "_rbuild": "4.6.1", "_assets": [ "extra/citation.cff", "extra/citation.html", "extra/citation.json", "extra/citation.txt", "extra/contents.json", "extra/cppRouting.html", "extra/NEWS.html", "extra/NEWS.txt", "extra/readme.html", "extra/readme.md", "manual.pdf" ], "_homeurl": "https://github.com/vlarmet/cpprouting", "_realowner": "vlarmet", "_cranurl": true, "_releases": [ { "version": "1.1", "date": "2019-06-21" }, { "version": "1.2", "date": "2019-09-30" }, { "version": "2.0", "date": "2020-01-07" }, { "version": "3.0", "date": "2022-11-28" }, { "version": "3.1", "date": "2022-12-01" }, { "version": "3.2", "date": "2025-11-28" } ], "_exports": [ "assign_traffic", "cpp_contract", "cpp_simplify", "get_aon", "get_detour", "get_distance_matrix", "get_distance_pair", "get_isochrone", "get_multi_paths", "get_path_pair", "makegraph", "to_df" ], "_help": [ { "page": "assign_traffic", "title": "Algorithms for solving the Traffic Assignment Problem (TAP).", "topics": [ "assign_traffic" ] }, { "page": "cpp_contract", "title": "Contraction hierarchies algorithm", "topics": [ "cpp_contract" ] }, { "page": "cpp_simplify", "title": "Reduce the number of edges by removing non-intersection nodes, duplicated edges and isolated loops in the graph.", "topics": [ "cpp_simplify" ] }, { "page": "get_aon", "title": "Given an origin-destination matrix, compute All-or-Nothing assignment.", "topics": [ "get_aon" ] }, { "page": "get_detour", "title": "Return the nodes that can be reached in a detour time set around the shortest path", "topics": [ "get_detour" ] }, { "page": "get_distance_matrix", "title": "Compute all shortest distance between origin and destination nodes.", "topics": [ "get_distance_matrix" ] }, { "page": "get_distance_pair", "title": "Compute shortest distance between origin and destination nodes.", "topics": [ "get_distance_pair" ] }, { "page": "get_isochrone", "title": "Compute isochrones/isodistances from nodes.", "topics": [ "get_isochrone" ] }, { "page": "get_multi_paths", "title": "Compute all shortest paths between origin and destination nodes.", "topics": [ "get_multi_paths" ] }, { "page": "get_path_pair", "title": "Compute shortest path between origin and destination nodes.", "topics": [ "get_path_pair" ] }, { "page": "makegraph", "title": "Construct graph", "topics": [ "makegraph" ] }, { "page": "to_df", "title": "Convert cppRouting graph to data.frame", "topics": [ "to_df" ] } ], "_readme": "https://github.com/vlarmet/cppRouting/raw/HEAD/README.md", "_rundeps": [ "data.table", "Rcpp", "RcppParallel", "RcppProgress" ], "_sysdeps": [ { "shlib": "libstdc++", "package": "libstdc++6", "source": "gcc", "version": "16-20260322-1ubuntu1", "name": "c++", "homepage": "http://gcc.gnu.org/", "description": "GNU Standard C++ Library v3" } ], "_vignettes": [ { "source": "cppRouting.Rmd", "filename": "cppRouting.html", "title": "cppRouting", "author": "Vincent Larmet", "engine": "knitr::rmarkdown", "headings": [ "Package presentation", "Main functions", "Routing algorithms", "Traffic assignment algorithms", "All-or-Nothing (AON)", "User Equilibrium (UE)", "Examples and applications using cppRouting" ], "created": "2022-11-28 13:41:10", "modified": "2022-11-28 13:41:10", "commits": 1 } ], "_score": 7.9847882616671795, "_indexed": false, "_nocasepkg": "cpprouting", "_universes": [ "fastverse" ], "_indexurl": "https://vlarmet.r-universe.dev/cppRouting", "_binaries": [ { "r": "4.7.0", "os": "linux", "version": "3.2", "date": "2026-07-05T13:34:25.000Z", "distro": "resolute", "arch": "aarch64", "commit": "d3b36705e8457cfddb8d3fe3a3fc2dfd415a70cf", "fileid": "https://r2.ropensci.org/09199a9cdaee920a369e791e8634555454761f22388208e042a071f23291970c", "status": "success", "check": "NOTE", "buildurl": "https://github.com/r-universe/fastverse/actions/runs/28742363742" }, { "r": "4.7.0", "os": "linux", "version": "3.2", "date": "2026-07-05T13:34:25.000Z", "distro": "resolute", "arch": "x86_64", "commit": "d3b36705e8457cfddb8d3fe3a3fc2dfd415a70cf", "fileid": "https://r2.ropensci.org/bee6c98beac7ebaa6f608dc8b1b532044efa0ded1f4ea2a1320b54b4a556116a", "status": "success", "check": "NOTE", "buildurl": "https://github.com/r-universe/fastverse/actions/runs/28742363742" }, { "r": "4.6.1", "os": "linux", "version": "3.2", "date": "2026-07-05T13:34:26.000Z", "distro": "resolute", "arch": "aarch64", "commit": "d3b36705e8457cfddb8d3fe3a3fc2dfd415a70cf", "fileid": "https://r2.ropensci.org/d0493ce8132264bd8063ad45fd943ad2511260d372dd6573a07d2276af2af9b4", "status": "success", "check": "NOTE", "buildurl": "https://github.com/r-universe/fastverse/actions/runs/28742363742" }, { "r": "4.6.1", "os": "linux", "version": "3.2", "date": "2026-07-05T13:34:59.000Z", "distro": "resolute", "arch": "x86_64", "commit": "d3b36705e8457cfddb8d3fe3a3fc2dfd415a70cf", "fileid": "https://r2.ropensci.org/98ac564987ba291945819a0e99cbf893416315c2fc45629439a60eb6f766ffe4", "status": "success", "check": "NOTE", "buildurl": "https://github.com/r-universe/fastverse/actions/runs/28742363742" }, { "r": "4.5.3", "os": "mac", "version": "3.2", "date": "2026-07-05T13:33:32.000Z", "arch": "aarch64", "commit": "d3b36705e8457cfddb8d3fe3a3fc2dfd415a70cf", "fileid": "https://r2.ropensci.org/38c4ecc9993a0262442ab165bf64019b0ba8b25787f203475979cd65433cf6ac", "status": "success", "check": "NOTE", "buildurl": "https://github.com/r-universe/fastverse/actions/runs/28742363742" }, { "r": "4.5.3", "os": "mac", "version": "3.2", "date": "2026-07-05T13:34:21.000Z", "arch": "x86_64", "commit": "d3b36705e8457cfddb8d3fe3a3fc2dfd415a70cf", "fileid": "https://r2.ropensci.org/16b4626660ad6dd420225f3ee9ede156e6f8745186d1797277349aa79486809e", "status": "success", "check": "NOTE", "buildurl": "https://github.com/r-universe/fastverse/actions/runs/28742363742" }, { "r": "4.6.1", "os": "mac", "version": "3.2", "date": "2026-07-05T13:33:49.000Z", "arch": "aarch64", "commit": "d3b36705e8457cfddb8d3fe3a3fc2dfd415a70cf", "fileid": "https://r2.ropensci.org/97b2bb36760fd4815fe6364385cfb4c32fec9d51c963940790a2d4923ab8744a", "status": "success", "check": "NOTE", "buildurl": "https://github.com/r-universe/fastverse/actions/runs/28742363742" }, { "r": "4.6.1", "os": "mac", "version": "3.2", "date": "2026-07-05T13:35:46.000Z", "arch": "x86_64", "commit": "d3b36705e8457cfddb8d3fe3a3fc2dfd415a70cf", "fileid": "https://r2.ropensci.org/45cab0636c0001518640789f7c099f5f9a4825dfd6b59a645456671c6008be58", "status": "success", "check": "NOTE", "buildurl": "https://github.com/r-universe/fastverse/actions/runs/28742363742" }, { "r": "4.6.0", "os": "wasm", "version": "3.2", "date": "2026-07-05T13:34:07.000Z", "arch": "emscripten", "commit": "d3b36705e8457cfddb8d3fe3a3fc2dfd415a70cf", "fileid": "https://r2.ropensci.org/99bc7237b03148379849dbec07284a34913fb7d455535b7a737e39b3e37690d9", "status": "success", "buildurl": "https://github.com/r-universe/fastverse/actions/runs/28742363742" }, { "r": "4.7.0", "os": "win", "version": "3.2", "date": "2026-07-05T13:33:20.000Z", "arch": "x86_64", "commit": "d3b36705e8457cfddb8d3fe3a3fc2dfd415a70cf", "fileid": "https://r2.ropensci.org/5f197e131e0697cb133355bd4014c660208f98f25b14b6d53af47cbbc9d074c0", "status": "success", "check": "NOTE", "buildurl": "https://github.com/r-universe/fastverse/actions/runs/28742363742" }, { "r": "4.5.3", "os": "win", "version": "3.2", "date": "2026-07-05T13:33:15.000Z", "arch": "x86_64", "commit": "d3b36705e8457cfddb8d3fe3a3fc2dfd415a70cf", "fileid": "https://r2.ropensci.org/6fb0a75d11924a910440f0f46ad3c70668a0094addc0d2e92577b18a9fe1d923", "status": "success", "check": "NOTE", "buildurl": "https://github.com/r-universe/fastverse/actions/runs/28742363742" }, { "r": "4.6.1", "os": "win", "version": "3.2", "date": "2026-07-05T13:33:38.000Z", "arch": "x86_64", "commit": "d3b36705e8457cfddb8d3fe3a3fc2dfd415a70cf", "fileid": "https://r2.ropensci.org/7b45eab388fc505496e818fac3443c48886befb96b68a368b1b690ec01b61556", "status": "success", "check": "NOTE", "buildurl": "https://github.com/r-universe/fastverse/actions/runs/28742363742" } ] }