chore: update outdated dependencies

Update petgraph 0.6→0.8, thiserror 1.0→2.0, rand 0.8→0.9, criterion 0.5→0.8.
Adapt code to API changes: rand trait rename, petgraph type param, criterion black_box.

Co-Authored-By: Claude Opus 4.6 <noreply@anthropic.com>

Author: GiggleLiu

Cargo.toml

@@ -16,21 +16,21 @@ default = ["ilp"]
 ilp = ["good_lp"]
 
 [dependencies]
-petgraph = { version = "0.6", features = ["serde-1"] }
+petgraph = { version = "0.8", features = ["serde-1"] }
 bitvec = "1.0"
 serde = { version = "1.0", features = ["derive"] }
 serde_json = "1.0"
-thiserror = "1.0"
+thiserror = "2.0"
 num-traits = "0.2"
 good_lp = { version = "1.8", default-features = false, features = ["highs"], optional = true }
 inventory = "0.3"
 ordered-float = "5.0"
-rand = "0.8"
+rand = "0.9"
 problemreductions-macros = { version = "0.1.0", path = "problemreductions-macros" }
 
 [dev-dependencies]
 proptest = "1.0"
-criterion = "0.5"
+criterion = "0.8"
 
 [[bench]]
 name = "solver_benchmarks"

benches/solver_benchmarks.rs

@@ -1,6 +1,7 @@
 //! Benchmarks for the BruteForce solver on various problem types.
 
-use criterion::{black_box, criterion_group, criterion_main, BenchmarkId, Criterion};
+use criterion::{criterion_group, criterion_main, BenchmarkId, Criterion};
+use std::hint::black_box;
 use problemreductions::models::graph::*;
 use problemreductions::topology::SimpleGraph;
 use problemreductions::models::optimization::*;

src/rules/graph.rs

@@ -474,8 +474,12 @@ impl ReductionGraph {
             None => return vec![],
         };
 
-        let paths: Vec<Vec<NodeIndex>> =
-            all_simple_paths(&self.graph, src_idx, dst_idx, 0, None).collect();
+        let paths: Vec<Vec<NodeIndex>> = all_simple_paths::<
+            Vec<NodeIndex>,
+            _,
+            std::hash::RandomState,
+        >(&self.graph, src_idx, dst_idx, 0, None)
+        .collect();
 
         paths
             .into_iter()

src/rules/unitdiskmapping/pathdecomposition.rs

@@ -14,7 +14,7 @@
 //! Experimental evaluation of a branch and bound algorithm for computing pathwidth.
 //! <https://doi.org/10.1007/978-3-319-07959-2_5>
 
-use rand::seq::SliceRandom;
+use rand::seq::IndexedRandom;
 use std::collections::{HashMap, HashSet};
 
 /// A layout representing a partial path decomposition.
@@ -296,7 +296,7 @@ fn greedy_step(
         .map(|(i, _)| i)
         .collect();
 
-    let mut rng = rand::thread_rng();
+    let mut rng = rand::rng();
     let &chosen_idx = best_indices.as_slice().choose(&mut rng).unwrap();
 
     layouts.into_iter().nth(chosen_idx).unwrap()