diff --git a/Contractor/EdgeBasedGraphFactory.cpp b/Contractor/EdgeBasedGraphFactory.cpp
index 2d58c90e8..07c4883b9 100644
--- a/Contractor/EdgeBasedGraphFactory.cpp
+++ b/Contractor/EdgeBasedGraphFactory.cpp
@@ -123,7 +123,7 @@ EdgeBasedGraphFactory::InsertEdgeBasedNode(const NodeID node_u, const NodeID nod
             m_geometry_compressor.GetBucketReference(e2);
         BOOST_ASSERT(forward_geometry.size() == reverse_geometry.size());
         BOOST_ASSERT(0 != forward_geometry.size());
-        const unsigned geometry_size = forward_geometry.size();
+        const unsigned geometry_size = static_cast<unsigned>(forward_geometry.size());
         BOOST_ASSERT(geometry_size > 1);
 
         // reconstruct bidirectional edge with individual weights and put each into the NN index
diff --git a/DataStructures/DynamicGraph.h b/DataStructures/DynamicGraph.h
index 81b1afe11..fcdd620bc 100644
--- a/DataStructures/DynamicGraph.h
+++ b/DataStructures/DynamicGraph.h
@@ -100,7 +100,7 @@ template <typename EdgeDataT> class DynamicGraph
             position += node_list[node].edges;
         }
         node_list.back().firstEdge = position;
-        edge_list.reserve((std::size_t)edge_list.size() * 1.1);
+        edge_list.reserve(static_cast<std::size_t>(edge_list.size() * 1.1));
         edge_list.resize(position);
         edge = 0;
         for (const auto node : osrm::irange(0u, number_of_nodes))