in-mem graph loading: skip reading neighbor list when out edge count …

…is 0
microsoft · Feb 16, 2024 · 8e4d10d · 8e4d10d
1 parent dbd702b
commit 8e4d10d
Showing 1 changed file with 6 additions and 3 deletions.
diff --git a/src/in_mem_graph_store.cpp b/src/in_mem_graph_store.cpp
@@ -135,9 +135,12 @@ std::tuple<uint32_t, uint32_t, size_t> InMemGraphStore::load_impl(AlignedFileRea
         graph_offset += sizeof(uint32_t);
         std::vector<uint32_t> tmp(k);
         tmp.reserve(k);
-        read_array(reader, tmp.data(), k, graph_offset);
-        graph_offset += k * sizeof(uint32_t);
-        cc += k;
+        if (k > 0)
+        {
+            read_array(reader, tmp.data(), k, graph_offset);
+            graph_offset += k * sizeof(uint32_t);
+            cc += k;
+        }
         _graph[nodes_read].swap(tmp);
         nodes_read++;
         if (nodes_read % 1000000 == 0)