Name	Size	Mode	Actions
alternative_path.hpp	1104	0644	editdlrm
direct_shortest_path.hpp	1076	0644	editdlrm
many_to_many.hpp	3039	0644	editdlrm
map_matching.hpp	1243	0644	editdlrm
routing_base.hpp	17312	0644	editdlrm
routing_base_ch.hpp	20740	0644	editdlrm
routing_base_mld.hpp	27398	0644	editdlrm
shortest_path.hpp	688	0644	editdlrm
shortest_path_impl.hpp	34889	0644	editdlrm
tile_turns.hpp	1201	0644	editdlrm

#ifndef DIRECT_SHORTEST_PATH_HPP #define DIRECT_SHORTEST_PATH_HPP #include "engine/algorithm.hpp" #include "engine/datafacade.hpp" #include "engine/internal_route_result.hpp" #include "engine/search_engine_data.hpp" #include "util/typedefs.hpp" namespace osrm::engine::routing_algorithms { /// This is a stripped down version of the general shortest path algorithm. /// The general algorithm always computes two queries for each leg. This is only /// necessary in case of vias, where the directions of the start node is constrained /// by the previous route. /// This variation is only an optimization for graphs with slow queries, for example /// not fully contracted graphs. template InternalRouteResult directShortestPathSearch(SearchEngineData &engine_working_data, const DataFacade &facade, const PhantomEndpointCandidates &endpoint_candidates); } // namespace osrm::engine::routing_algorithms #endif /* DIRECT_SHORTEST_PATH_HPP */