# -------------------------------------------- # CITATION file created with {cffr} R package # See also: https://docs.ropensci.org/cffr/ # -------------------------------------------- cff-version: 1.2.0 message: 'To cite package "cppRouting" in publications use:' type: software license: GPL-2.0-or-later title: 'cppRouting: Algorithms for Routing and Solving the Traffic Assignment Problem' version: '3.1' doi: 10.32614/CRAN.package.cppRouting abstract: 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) ), bidirectional Dijkstra (Goldberg, Andrew & Fonseca F. Werneck, Renato (2005) ), A* search (P. E. Hart, N. J. Nilsson et B. Raphael (1968) ), new bidirectional A* (Pijls & Post (2009) ), Contraction hierarchies (R. Geisberger, P. Sanders, D. Schultes and D. Delling (2008) ), PHAST (D. Delling, A.Goldberg, A. Nowatzyk, R. Werneck (2011) ). Algorithms for solving the traffic assignment problem are All-or-Nothing assignment, Method of Successive Averages, Frank-Wolfe algorithm (M. Fukushima (1984) ), Conjugate and Bi-Conjugate Frank-Wolfe algorithms (M. Mitradjieva, P. O. Lindberg (2012) ), Algorithm-B (R. B. Dial (2006) ). authors: - family-names: Larmet given-names: Vincent email: larmet.vincent@gmail.com repository: https://fastverse.r-universe.dev repository-code: https://github.com/vlarmet/cppRouting commit: b1715a8544f4485c87c1b41dfb08fd65af997b62 url: https://github.com/vlarmet/cppRouting date-released: '2022-11-28' contact: - family-names: Larmet given-names: Vincent email: larmet.vincent@gmail.com