migrated out of edge based graph factory

include/engine/api/route_api.hpp

@@ -86,7 +86,6 @@ class RouteAPI : public BaseAPI
         leg_geometries.reserve(number_of_legs);
 
         unpacked_path_segments = guidance::postProcess(std::move(unpacked_path_segments));
-        BOOST_ASSERT(locations.size() == number_of_legs + 1);
         for (auto idx : util::irange(0UL, number_of_legs))
         {
             const auto &phantoms = segment_end_coordinates[idx];

include/engine/guidance/assemble_steps.hpp

@@ -79,7 +79,7 @@ std::vector<RouteStep> assembleSteps(const DataFacadeT &facade,
     steps.reserve(number_of_segments);
 
     // TODO do computation based on distance and choose better next vertex
-    BOOST_ASSERT(leg_geometry.size() >= 4); // source, phantom, closest positions on way
+    BOOST_ASSERT(leg_geometry.locations.size() >= 4); // source, phantom, closest positions on way
     const auto initial_modifier =
         source_location
             ? angleToDirectionModifier(util::coordinate_calculation::computeAngle(

include/engine/guidance/turn_classification.hpp

@@ -51,7 +51,7 @@ classifyIntersection(NodeID nid,
     const auto base_coordinate = getRepresentativeCoordinate(nid, graph.GetTarget(base_id), base_id,
                                                              graph.GetEdgeData(base_id).reversed,
                                                              compressed_geometries, query_nodes);
-    const auto node_coordinate = Coordinate(query_nodes[nid].lon, query_nodes[nid].lat);
+    const auto node_coordinate = util::Coordinate(query_nodes[nid].lon, query_nodes[nid].lat);
 
     // generate a list of all turn angles between a base edge, the node and a current edge
     for (const EdgeID eid : graph.GetAdjacentEdgeRange(nid))