fix: update rand API usage for rand 0.10 (RngExt trait)

Co-authored-by: samueltardieu <44656+samueltardieu@users.noreply.github.com>

Author: Copilot

benches/algos.rs

@@ -4,7 +4,7 @@ use pathfinding::prelude::{
     astar, bfs, bfs_bidirectional, dfs, dijkstra, fringe, idastar, iddfs, separate_components,
 };
 use rand::seq::SliceRandom;
-use rand::{Rng as _, RngCore as _, SeedableRng as _};
+use rand::{Rng as _, RngExt as _, SeedableRng as _};
 use rand_xorshift::XorShiftRng;
 use std::collections::HashSet;
 

benches/iai_kuhn_munkres.rs

@@ -1,6 +1,6 @@
 use iai_callgrind::{library_benchmark, library_benchmark_group, main};
 use pathfinding::prelude::{Matrix, kuhn_munkres};
-use rand::{Rng as _, SeedableRng as _};
+use rand::{RngExt as _, SeedableRng as _};
 use rand_xorshift::XorShiftRng;
 
 const RNG_SEED: [u8; 16] = [

benches/iai_separate_components.rs

@@ -1,7 +1,7 @@
 use iai_callgrind::{library_benchmark, library_benchmark_group, main};
 use itertools::Itertools;
 use pathfinding::prelude::separate_components;
-use rand::{Rng as _, RngCore as _, SeedableRng as _, prelude::SliceRandom};
+use rand::{Rng as _, RngExt as _, SeedableRng as _, prelude::SliceRandom};
 use rand_xorshift::XorShiftRng;
 use std::collections::HashSet;
 

benches/kuhn_munkres.rs

@@ -1,6 +1,6 @@
 use criterion::{BenchmarkId, Criterion, criterion_group, criterion_main};
 use pathfinding::prelude::{Matrix, kuhn_munkres};
-use rand::{Rng as _, SeedableRng as _};
+use rand::{RngExt as _, SeedableRng as _};
 use rand_xorshift::XorShiftRng;
 
 fn compare_size(c: &mut Criterion) {

benches/separate_components.rs

@@ -1,7 +1,7 @@
 use criterion::{Criterion, criterion_group, criterion_main};
 use itertools::Itertools;
 use pathfinding::prelude::separate_components;
-use rand::{Rng as _, RngCore as _, SeedableRng as _, prelude::SliceRandom};
+use rand::{Rng as _, RngExt as _, SeedableRng as _, prelude::SliceRandom};
 use rand_xorshift::XorShiftRng;
 use std::collections::HashSet;
 

examples/kuhn_munkres_complexity.rs

@@ -6,7 +6,7 @@
 //! verify this complexity.
 
 use pathfinding::prelude::{Matrix, kuhn_munkres};
-use rand::{Rng, SeedableRng};
+use rand::{RngExt, SeedableRng};
 use rand_xorshift::XorShiftRng;
 use std::time::Instant;
 

tests/dijkstra-all.rs

@@ -1,5 +1,5 @@
 use pathfinding::prelude::*;
-use rand::{Rng as _, rngs};
+use rand::{RngExt as _, rngs};
 
 fn build_network(size: usize) -> Matrix<usize> {
     let mut network = Matrix::new(size, size, 0);