mirror of
https://codeberg.org/comaps/comaps
synced 2025-12-20 13:23:59 +00:00
38e98df6cc
# Conflicts: # CMakeLists.txt # android/app/src/main/java/app/organicmaps/settings/SettingsPrefsFragment.java # android/sdk/src/main/cpp/app/organicmaps/sdk/Framework.hpp # android/sdk/src/main/cpp/app/organicmaps/sdk/OrganicMaps.cpp # android/sdk/src/main/cpp/app/organicmaps/sdk/util/Config.cpp # libs/indexer/data_source.hpp # libs/indexer/feature.hpp # libs/indexer/ftypes_matcher.hpp # libs/map/framework.cpp # libs/map/traffic_manager.cpp # libs/routing/absent_regions_finder.cpp # libs/routing/edge_estimator.hpp # libs/routing/index_router.cpp # libs/routing/index_router.hpp # libs/routing/routing_session.hpp # libs/routing_common/num_mwm_id.hpp # libs/traffic/traffic_info.cpp # qt/mainwindow.hpp # qt/preferences_dialog.cpp # tools/openlr/helpers.hpp # tools/openlr/openlr_decoder.cpp # tools/openlr/openlr_decoder.hpp # tools/openlr/openlr_stat/openlr_stat.cpp # tools/openlr/router.hpp # tools/openlr/score_candidate_paths_getter.cpp # tools/openlr/score_candidate_paths_getter.hpp # xcode/CoMaps.xcworkspace/contents.xcworkspacedata
45 lines
1.5 KiB
C++
45 lines
1.5 KiB
C++
#pragma once
|
|
|
|
#include "openlr/graph.hpp"
|
|
#include "openlr/openlr_model.hpp"
|
|
#include "openlr/road_info_getter.hpp"
|
|
#include "openlr/score_types.hpp"
|
|
#include "openlr/stats.hpp"
|
|
|
|
#include <cstddef>
|
|
#include <cstdint>
|
|
#include <vector>
|
|
|
|
namespace openlr
|
|
{
|
|
class ScorePathsConnector
|
|
{
|
|
public:
|
|
ScorePathsConnector(Graph & graph, RoadInfoGetter & infoGetter, v2::Stats & stat);
|
|
|
|
/**
|
|
* @brief Connects `lineCandidates` and fills `resultPath` with the path with maximum score
|
|
* if there's a good enough one.
|
|
*
|
|
* @return true if the best path is found and false otherwise.
|
|
*/
|
|
bool FindBestPath(std::vector<LocationReferencePoint> const & points,
|
|
std::vector<std::vector<ScorePath>> const & lineCandidates, LinearSegmentSource source,
|
|
std::vector<Graph::EdgeVector> & resultPath);
|
|
|
|
private:
|
|
bool FindShortestPath(Graph::Edge const & from, Graph::Edge const & to, LinearSegmentSource source,
|
|
FunctionalRoadClass lowestFrcToNextPoint, uint32_t maxPathLength, Graph::EdgeVector & path);
|
|
|
|
bool ConnectAdjacentCandidateLines(Graph::EdgeVector const & from, Graph::EdgeVector const & to,
|
|
LinearSegmentSource source, FunctionalRoadClass lowestFrcToNextPoint,
|
|
double distanceToNextPoint, Graph::EdgeVector & resultPath);
|
|
|
|
Score GetScoreForUniformity(Graph::EdgeVector const & path);
|
|
|
|
Graph & m_graph;
|
|
RoadInfoGetter & m_infoGetter;
|
|
v2::Stats & m_stat;
|
|
};
|
|
} // namespace openlr
|