Method GetAllSuitablePaths

tools/openlr/score_candidate_paths_getter.cpp:130–212

}

void ScoreCandidatePathsGetter::GetAllSuitablePaths(ScoreEdgeVec const & startLines, LinearSegmentSource source,
                                                    bool isLastPoint, double bearDistM,
                                                    FunctionalRoadClass functionalRoadClass, FormOfWay formOfWay,
                                                    double distanceToNextPointM, vector<shared_ptr<Link>> & allPaths)
{
  CHECK_NOT_EQUAL(source, LinearSegmentSource::NotValid, ());

  queue<shared_ptr<Link>> q;

  for (auto const & e : startLines)
  {
    Score roadScore = 0;  // Score based on functional road class and form of way.
    if (source == LinearSegmentSource::FromLocationReferenceTag &&
        !PassesRestrictionV3(e.m_edge, functionalRoadClass, formOfWay, m_infoGetter, roadScore))
    {
      continue;
    }

    q.push(make_shared<Link>(nullptr /* parent */, e.m_edge, 0 /* distanceM */, e.m_score, roadScore));
  }

  // Filling |allPaths| staring from |startLines| which have passed functional road class
  // and form of way restrictions. All paths in |allPaths| are shorter then |bearDistM| plus
  // one segment length.
  while (!q.empty())
  {
    auto const u = q.front();
    q.pop();

    auto const & currentEdge = u->m_edge;
    auto const currentEdgeLen = EdgeLength(currentEdge);

    // The path from the start of the openlr segment to the finish to the openlr segment should be
    // much shorter then the distance of any connection of openlr segment.
    // This condition should be checked because otherwise in rare case |q| may be overfilled.
    if (u->m_distanceM > distanceToNextPointM)
      continue;

    if (u->m_distanceM + currentEdgeLen >= bearDistM)
    {
      allPaths.emplace_back(std::move(u));
      continue;
    }

    CHECK_LESS(u->m_distanceM + currentEdgeLen, bearDistM, ());

    Graph::EdgeListT edges;
    if (!isLastPoint)
      m_graph.GetOutgoingEdges(currentEdge.GetEndJunction(), edges);
    else
      m_graph.GetIngoingEdges(currentEdge.GetStartJunction(), edges);

    // It's possible that road edges are duplicated a lot of times. It's a error but
    // a mapper may do that. To prevent a combinatorial explosion while matching
    // duplicated edges should be removed.
    scpg::EdgeSortUniqueByStartAndEndPoints(edges);

    for (auto const & e : edges)