Use 'C++' Standard Template Library containers interactively in R. Includes sets, unordered sets, multisets, unordered multisets, maps, 
  unordered maps, multimaps, unordered multimaps, stacks, queues, priority queues, vectors, deques, forward lists, and lists.

Compare double-precision floating point vectors using
    relative differences. All equality operations are calculated using
    'cpp11'.

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://archive.siam.org/meetings/alenex05/papers/03agoldberg.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>).

Building on top of the 'RcppArmadillo' linear
    algebra functionalities to do fast spatial interaction models in the
    context of urban analytics, geography, transport modelling. It uses
    the Newton root search algorithm to determine the optimal cost
    exponent and can run country level models with thousands of origins
    and destinations. It aims at implementing an easy approach based on
    matrices, that can originate from various routing and processing steps earlier in an workflow. 
    Currently, the simplest form of production, destination and
    doubly constrained models are implemented.
    Schlosser et al. (2023) <doi:10.48550/arXiv.2309.02112>.