https://mobility-team.r-universe.devRecent package updates in mobility-teamR-universehttps://github.com/mobility-team.pnghttps://mobility-team.r-universe.devTue, 07 Jul 2026 15:55:19 GMTflx.pouchain@gmail.com (Félix Pouchain)Download and import of 'OpenStreetMap' ('OSM') data as 'sf' or 'sp' objects. 'OSM' data are extracted from the 'Overpass' web server (<https://overpass-api.de/>) and processed with very fast 'C++' routines for return to 'R'.https://github.com/r-universe/mobility-team/actions/runs/28880715780Tue, 07 Jul 2026 15:55:19 GMTosmdata.mobility0.2.5.005successhttps://mobility-team.r-universe.devhttps://github.com/mobility-team/osmdata.mobilityosmdata.Rmdosmdata.htmlosmdata.mobility 2017-02-12 20:49:562026-07-07 12:20:40osmdata-sc.Rmdosmdata-sc.htmlElevation data and OSM: The osmdata_sc function 2019-04-25 08:06:432024-01-02 16:54:16osm-sf-translation.Rmdosm-sf-translation.htmlTranslation of OSM to Simple Features 2017-01-19 16:57:532024-01-02 16:54:16query-split.Rmdquery-split.htmlSplitting large queries 2022-01-23 13:10:542026-07-07 12:20:40flx.pouchain@gmail.com (Félix Pouchain)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>), and customizable contraction hierarchies for repeated edge-cost updates on stable graph topologies. 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>).https://github.com/r-universe/mobility-team/actions/runs/28879120184Tue, 07 Jul 2026 15:40:28 GMTcppRoutingCCH3.2.1successhttps://mobility-team.r-universe.devhttps://github.com/mobility-team/cppRoutingCCHcppRouting.RmdcppRouting.htmlcppRouting2022-11-28 13:41:102022-11-28 13:41:10