/srv/osrm/osrm-backend/include/engine/routing_algorithms
NameSizeModeActions
alternative_path.hpp11040644editdlrm
direct_shortest_path.hpp10760644editdlrm
many_to_many.hpp30390644editdlrm
map_matching.hpp12430644editdlrm
routing_base.hpp173120644editdlrm
routing_base_ch.hpp207400644editdlrm
routing_base_mld.hpp273980644editdlrm
shortest_path.hpp6880644editdlrm
shortest_path_impl.hpp348890644editdlrm
tile_turns.hpp12010644editdlrm
Edit: /srv/osrm/osrm-backend/include/engine/routing_algorithms/map_matching.hpp (1243B)
#ifndef MAP_MATCHING_HPP #define MAP_MATCHING_HPP #include "engine/algorithm.hpp" #include "engine/datafacade.hpp" #include "engine/map_matching/sub_matching.hpp" #include "engine/search_engine_data.hpp" #include namespace osrm::engine::routing_algorithms { using CandidateList = std::vector; using CandidateLists = std::vector; using SubMatchingList = std::vector; static const constexpr double DEFAULT_GPS_PRECISION = 5; //[1] "Hidden Markov Map Matching Through Noise and Sparseness"; // P. Newson and J. Krumm; 2009; ACM GIS template SubMatchingList mapMatching(SearchEngineData &engine_working_data, const DataFacade &facade, const CandidateLists &candidates_list, const std::vector &trace_coordinates, const std::vector &trace_timestamps, const std::vector> &trace_gps_precision, const bool allow_splitting); } // namespace osrm::engine::routing_algorithms #endif /* MAP_MATCHING_HPP */