Method CheckAndProcessTransitFeatures

libs/routing/single_vehicle_world_graph.cpp:40–83

}

void SingleVehicleWorldGraph::CheckAndProcessTransitFeatures(Segment const & parent, JointEdgeListT & jointEdges,
                                                             WeightListT & parentWeights, bool isOutgoing)
{
  JointEdgeListT newCrossMwmEdges;

  NumMwmId const mwmId = parent.GetMwmId();

  for (size_t i = 0; i < jointEdges.size(); ++i)
  {
    JointSegment const & target = jointEdges[i].GetTarget();

    vector<Segment> twins;
    m_crossMwmGraph->GetTwinFeature(target.GetSegment(true /* start */), isOutgoing, twins);
    if (twins.empty())
    {
      ASSERT_EQUAL(mwmId, target.GetMwmId(), ());
      continue;
    }

    auto & currentIndexGraph = GetIndexGraph(mwmId);
    for (auto const & twin : twins)
    {
      NumMwmId const twinMwmId = twin.GetMwmId();
      Segment const start(twinMwmId, twin.GetFeatureId(), target.GetSegmentId(isOutgoing), target.IsForward());

      auto & twinIndexGraph = GetIndexGraph(twinMwmId);

      IndexGraph::PointIdListT lastPoints;
      twinIndexGraph.GetLastPointsForJoint({start}, isOutgoing, lastPoints);
      ASSERT_EQUAL(lastPoints.size(), 1, ());

      if (auto edge = currentIndexGraph.GetJointEdgeByLastPoint(parent, target.GetSegment(isOutgoing), isOutgoing,
                                                                lastPoints.back()))
      {
        newCrossMwmEdges.emplace_back(*edge);
        newCrossMwmEdges.back().GetTarget().AssignID(twin);

        parentWeights.push_back(parentWeights[i]);
      }
    }
  }

  jointEdges.insert(jointEdges.end(), newCrossMwmEdges.begin(), newCrossMwmEdges.end());
}

void SingleVehicleWorldGraph::GetEdgeList(astar::VertexData<Segment, RouteWeight> const & vertexData, bool isOutgoing,
                                          bool useRoutingOptions, bool useAccessConditional, SegmentEdgeListT & edges)