openlr/paths_connector.hpp


1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36

#pragma once

#include "openlr/graph.hpp"
#include "openlr/openlr_model.hpp"
#include "openlr/stats.hpp"

#include <cstddef>
#include <cstdint>
#include <vector>

namespace openlr
{
class PathsConnector
{
public:
  PathsConnector(double const pathLengthTolerance, Graph & graph, v2::Stats & stat);

  bool ConnectCandidates(std::vector<LocationReferencePoint> const & points,
                         std::vector<std::vector<Graph::EdgeVector>> const & lineCandidates,
                         std::vector<Graph::EdgeVector> & resultPath);

private:
  bool FindShortestPath(Graph::Edge const & from, Graph::Edge const & to,
                        FunctionalRoadClass const frc, uint32_t const maxPathLength,
                        Graph::EdgeVector & path);

  bool ConnectAdjacentCandidateLines(Graph::EdgeVector const & from, Graph::EdgeVector const & to,
                                     FunctionalRoadClass const frc,
                                     double const distanceToNextPoint,
                                     Graph::EdgeVector & resultPath);

  double m_pathLengthTolerance;
  Graph & m_graph;
  v2::Stats & m_stat;
};
}  // namespace openlr