diff --git a/include/partition/edge_based_graph_reader.hpp b/include/partition/edge_based_graph_reader.hpp
index 390ab611b..39f0afe73 100644
--- a/include/partition/edge_based_graph_reader.hpp
+++ b/include/partition/edge_based_graph_reader.hpp
@@ -40,7 +40,7 @@ struct EdgeBasedGraphEdge : EdgeBasedGraph::InputEdge
 
 // Bidirectional (s,t) to (s,t) and (t,s)
 std::vector<extractor::EdgeBasedEdge>
-SplitBidirectionalEdges(const std::vector<extractor::EdgeBasedEdge> &edges)
+splitBidirectionalEdges(const std::vector<extractor::EdgeBasedEdge> &edges)
 {
     std::vector<extractor::EdgeBasedEdge> directed;
     directed.reserve(edges.size() * 2);
@@ -68,7 +68,7 @@ SplitBidirectionalEdges(const std::vector<extractor::EdgeBasedEdge> &edges)
 }
 
 std::vector<EdgeBasedGraphEdge>
-PrepareEdgesForUsageInGraph(std::vector<extractor::EdgeBasedEdge> edges)
+prepareEdgesForUsageInGraph(std::vector<extractor::EdgeBasedEdge> edges)
 {
     std::sort(begin(edges), end(edges));
 
@@ -167,9 +167,10 @@ struct EdgeBasedGraphReader
         // - adaptToContractorInput
         // - GraphContractor::GraphContractor
         // and should really be abstracted over.
+        // FIXME: edges passed as a const reference, can be changed pass-by-value if can be moved
 
-        auto directed = SplitBidirectionalEdges(edges);
-        auto tidied = PrepareEdgesForUsageInGraph(std::move(directed));
+        auto directed = splitBidirectionalEdges(edges);
+        auto tidied = prepareEdgesForUsageInGraph(std::move(directed));
 
         return std::make_unique<EdgeBasedGraph>(num_nodes, std::move(tidied));
     }
diff --git a/src/storage/storage.cpp b/src/storage/storage.cpp
index 30342f3a5..0e05241a5 100644
--- a/src/storage/storage.cpp
+++ b/src/storage/storage.cpp
@@ -1011,8 +1011,8 @@ void Storage::PopulateData(const DataLayout &layout, char *memory_ptr)
             std::vector<extractor::EdgeBasedEdge> original_edges(number_of_edges);
             reader.ReadInto(original_edges);
 
-            original_edges = partition::SplitBidirectionalEdges(std::move(original_edges));
-            auto edges = partition::PrepareEdgesForUsageInGraph(std::move(original_edges));
+            original_edges = partition::splitBidirectionalEdges(std::move(original_edges));
+            auto edges = partition::prepareEdgesForUsageInGraph(std::move(original_edges));
             BOOST_ASSERT(edges.size() <= 2 * number_of_edges);
 
             auto nodes_ptr = layout.GetBlockPtr<EdgeBasedGraph::NodeArrayEntry, true>(