Fix corner case. (#22152)

neunhoef · web-flow · commit 30e37cd19242 · 2025-12-02T12:38:54.000+01:00
diff --git a/arangod/Aql/ExecutionNode/GraphNode.cpp b/arangod/Aql/ExecutionNode/GraphNode.cpp
@@ -784,7 +784,7 @@ CostEstimate GraphNode::estimateCost() const {
     size_t estDepth = _options->estimateDepth();
     double tmpNrItems = incoming * std::pow(baseNumItems, estDepth);
     // Protect against size_t overflow, just to be sure.
-    if (tmpNrItems > static_cast<double>(std::numeric_limits<size_t>::max())) {
+    if (tmpNrItems >= static_cast<double>(std::numeric_limits<size_t>::max())) {
       // This will be an expensive query...
       estimate.estimatedNrItems = std::numeric_limits<size_t>::max();
     } else {
diff --git a/arangod/Graph/ShortestPathOptions.cpp b/arangod/Graph/ShortestPathOptions.cpp
@@ -171,7 +171,7 @@ double ShortestPathOptions::estimateCost(size_t& nrItems) const {
   // This theory asumes that the shortest path is at most 7 steps of length
 
   double tmp = std::pow(baseCreateItems, 7);
-  nrItems = tmp > static_cast<double>(std::numeric_limits<size_t>::max())
+  nrItems = tmp >= static_cast<double>(std::numeric_limits<size_t>::max())
                 ? std::numeric_limits<size_t>::max()
                 : static_cast<size_t>(tmp);
   return std::pow(baseCost, 7);
