graph: fix few benchmark implem.

Mizux · Mizux · commit 0b94fad15882 · 2026-05-07T18:15:35.000+02:00
diff --git a/ortools/graph/dag_constrained_shortest_path_benchmark.cc b/ortools/graph/dag_constrained_shortest_path_benchmark.cc
@@ -39,7 +39,7 @@ BuildRandomDag(const NodeIndex num_nodes, const ArcIndex num_arcs) {
   absl::BitGen bit_gen;
   CHECK_GE(num_nodes, 2);
   CHECK_GE(num_arcs, 1);
-  CHECK_LE(num_arcs, (num_nodes * (num_nodes - 1)) / 2);
+  CHECK_LE(num_arcs, (int64_t{num_nodes} * (num_nodes - 1)) / 2);
   std::vector<NodeIndex> topological_order(num_nodes);
   topological_order.back() = num_nodes - 1;
   absl::Span<NodeIndex> non_start_end =
diff --git a/ortools/graph/linear_assignment_benchmark.cc b/ortools/graph/linear_assignment_benchmark.cc
@@ -48,8 +48,7 @@ ConstructRandomAssignmentForNewGraphApi(const int left_nodes,
   }
 
   // Finalize the graph.
-  std::vector<typename GraphType::ArcIndex> permutation;
-  auto graph = std::move(builder).BuildAndPermute(permutation, arc_costs);
+  auto graph = std::move(builder).BuildAndPermute(arc_costs);
 
   // Create the assignment.
   auto assignment = std::make_unique<LinearSumAssignment<GraphType, int64_t>>(

Original file line number	Diff line number	Diff line change
`@@ -48,8 +48,7 @@ ConstructRandomAssignmentForNewGraphApi(const int left_nodes,`
`48`	`48`	`}`
`49`	`49`
`50`	`50`	`// Finalize the graph.`
`51`		`- std::vector<typename GraphType::ArcIndex> permutation;`
`52`		`- auto graph = std::move(builder).BuildAndPermute(permutation, arc_costs);`
	`51`	`+ auto graph = std::move(builder).BuildAndPermute(arc_costs);`
`53`	`52`
`54`	`53`	`// Create the assignment.`
`55`	`54`	`auto assignment = std::make_unique<LinearSumAssignment<GraphType, int64_t>>(`