actually calculate distance instead of using .distance which is a timing value

include/extractor/guidance/coordinate_extractor.hpp

@@ -40,6 +40,11 @@ class CoordinateExtractor
                                                           const bool traversed_in_reverse,
                                                           const NodeID to_node) const;
 
+    // wrapper in case of normal forward edges (traversed_in_reverse = false, to_node =
+    // node_based_graph.GetTarget(turn_edge)
+    std::vector<util::Coordinate> GetForwardCoordinatesAlongRoad(const NodeID from,
+                                                                 const EdgeID turn_edge) const;
+
     /* When extracting the coordinates, we first extract all coordinates. We don't care about most
      * of them, though.
      *

include/extractor/guidance/intersection_generator.hpp

@@ -47,6 +47,9 @@ class IntersectionGenerator
                                            NodeID *resulting_from_node,
                                            EdgeID *resulting_via_edge) const;
 
+    // Allow access to the coordinate extractor for all owners
+    const CoordinateExtractor &GetCoordinateExtractor() const;
+
   private:
     const util::NodeBasedDynamicGraph &node_based_graph;
     const RestrictionMap &restriction_map;