# ------------------------------------------------
# CITATION.cff file created with {cffr} R package
# See also: https://docs.ropensci.org/cffr/
# ------------------------------------------------
 
cff-version: 1.2.0
message: 'To cite package "cppRoutingCCH" in publications use:'
type: software
license: GPL-2.0-or-later
title: 'cppRoutingCCH: Algorithms for Routing and Solving the Traffic Assignment Problem'
version: 3.2.1
doi: 10.32614/CRAN.package.cppRoutingCCH
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) <https://doi.org/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) <https://doi.org/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)
  <https://doi.org/10.1007/978-3-540-68552-4_24>), PHAST (D. Delling, A.Goldberg,
  A. Nowatzyk, R. Werneck (2011) <https://doi.org/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)
  <https://doi.org/10.1016/0191-2615(84)90029-8>), Conjugate and Bi-Conjugate Frank-Wolfe
  algorithms (M. Mitradjieva, P. O. Lindberg (2012) <https://doi.org/10.1287/trsc.1120.0409>),
  Algorithm-B (R. B. Dial (2006) <https://doi.org/10.1016/j.trb.2006.02.008>).
authors:
- family-names: Larmet
  given-names: Vincent
  email: larmet.vincent@gmail.com
- family-names: Pouchain
  given-names: Félix
  email: flx.pouchain@gmail.com
repository: https://mobility-team.r-universe.dev
repository-code: https://github.com/mobility-team/cppRoutingCCH
commit: 95d95f355569dbfb978030023f39eab3201a68e6
url: https://github.com/mobility-team/cppRoutingCCH
date-released: '2026-07-07'
contact:
- family-names: Pouchain
  given-names: Félix
  email: flx.pouchain@gmail.com