overflow check for graph edges

Author: N-Maas

mt-kahypar/datastructures/dynamic_graph_factory.cpp

@@ -28,6 +28,8 @@
 
 #include "dynamic_graph_factory.h"
 
+#include <limits>
+
 #include <tbb/parallel_for.h>
 #include <tbb/parallel_invoke.h>
 
@@ -68,6 +70,13 @@ DynamicGraph DynamicGraphFactory::construct_from_graph_edges(
         const mt_kahypar_hyperedge_weight_t* edge_weight,
         const mt_kahypar_hypernode_weight_t* node_weight,
         const bool stable_construction_of_incident_edges) {
+  if (num_edges > std::numeric_limits<HyperedgeID>::max() / 2) {
+    std::string msg = std::string("number of edges overflows ID range (note: graph edges are duplicated, require +1 bit)");
+    if constexpr (sizeof(HyperedgeID) < 8) {
+      msg += "; build with -DKAHYPAR_USE_64_BIT_IDS=ON to support larger ID ranges";
+    }
+    throw InvalidInputException(msg);
+  }
   if (edge_vector.size() != num_edges) {
     throw InvalidInputException("Number of edges does not match length of input data!");
   }

mt-kahypar/datastructures/static_graph_factory.cpp

@@ -28,6 +28,8 @@
 
 #include "static_graph_factory.h"
 
+#include <limits>
+
 #include <tbb/parallel_for.h>
 #include <tbb/parallel_invoke.h>
 
@@ -95,6 +97,13 @@ namespace mt_kahypar::ds {
           const mt_kahypar_hyperedge_weight_t* edge_weight,
           const mt_kahypar_hypernode_weight_t* node_weight,
           const bool stable_construction_of_incident_edges) {
+    if (num_edges > std::numeric_limits<HyperedgeID>::max() / 2) {
+      std::string msg = std::string("number of edges overflows ID range (note: graph edges are duplicated, require +1 bit)");
+      if constexpr (sizeof(HyperedgeID) < 8) {
+        msg += "; build with -DKAHYPAR_USE_64_BIT_IDS=ON to support larger ID ranges";
+      }
+      throw InvalidInputException(msg);
+    }
     if (edge_vector.size() != num_edges) {
       throw InvalidInputException("Number of edges does not match length of input data!");
     }