Allow clippy::needless_range_loop in benches

Author: starovoid

benches/acyclic.rs

@@ -11,6 +11,7 @@ use test::Bencher;
 
 /// Dynamic toposort using Acyclic<G>
 #[bench]
+#[allow(clippy::needless_range_loop)]
 fn acyclic_bench(bench: &mut Bencher) {
     static NODE_COUNT: usize = 100;
     let mut g = Acyclic::<DiGraph<usize, ()>>::new();
@@ -33,6 +34,7 @@ fn acyclic_bench(bench: &mut Bencher) {
 
 /// As a baseline: build the graph and toposort it every time a new edge is added
 #[bench]
+#[allow(clippy::needless_range_loop)]
 fn toposort_baseline_bench(bench: &mut Bencher) {
     static NODE_COUNT: usize = 100;
     let mut g = DiGraph::<usize, ()>::new();

benches/bellman_ford.rs

@@ -10,6 +10,7 @@ use test::Bencher;
 use petgraph::algo::{bellman_ford, find_negative_cycle};
 
 #[bench]
+#[allow(clippy::needless_range_loop)]
 fn bellman_ford_bench(bench: &mut Bencher) {
     static NODE_COUNT: usize = 100;
     let mut g = Graph::new();
@@ -35,6 +36,7 @@ fn bellman_ford_bench(bench: &mut Bencher) {
 }
 
 #[bench]
+#[allow(clippy::needless_range_loop)]
 fn find_negative_cycle_bench(bench: &mut Bencher) {
     static NODE_COUNT: usize = 100;
     let mut g = Graph::new();

benches/dijkstra.rs

@@ -10,6 +10,7 @@ use test::Bencher;
 use petgraph::algo::dijkstra;
 
 #[bench]
+#[allow(clippy::needless_range_loop)]
 fn dijkstra_bench(bench: &mut Bencher) {
     static NODE_COUNT: usize = 10_000;
     let mut g = Graph::new_undirected();

benches/floyd_warshall.rs

@@ -10,6 +10,7 @@ use test::Bencher;
 use petgraph::algo::floyd_warshall;
 
 #[bench]
+#[allow(clippy::needless_range_loop)]
 fn floyd_warshall_bench(bench: &mut Bencher) {
     static NODE_COUNT: usize = 100;
     let mut g = Graph::new_undirected();

benches/k_shortest_path.rs

@@ -10,6 +10,7 @@ use test::Bencher;
 use petgraph::algo::k_shortest_path;
 
 #[bench]
+#[allow(clippy::needless_range_loop)]
 fn k_shortest_path_bench(bench: &mut Bencher) {
     static NODE_COUNT: usize = 10_000;
     let mut g = Graph::new_undirected();