Add criterion benchmark

src/belt_finding/brute_force.rs

@@ -7,7 +7,7 @@ use crate::misc::Map;
 
 use super::{Direction, Position, COLORS};
 
-#[derive(Default)]
+#[derive(Default, Clone)]
 pub struct BruteforceField {
     pub blocked: bool,
     underground_vertical: bool,
@@ -53,6 +53,7 @@ impl PathField {
 
 static MAX_UNDERGROUND_LENGTH: u8 = 6;
 
+#[derive(Clone)]
 pub struct BruteforceBuilder {
     map: Map<BruteforceField>,
     path: Vec<[(Position, Direction); 2]>,
@@ -110,6 +111,7 @@ impl BruteforceBuilder {
     }
 }
 
+#[derive(Clone)]
 struct Problem {
     path: Vec<PathField>,
     end_pos: Position,
@@ -117,6 +119,7 @@ struct Problem {
     finished: bool,
 }
 
+#[derive(Clone)]
 pub struct Bruteforce {
     map: Map<BruteforceField>,
     problems: Vec<Problem>,

src/graph/wheighted_graph/shortest_path.rs

@@ -119,12 +119,12 @@ where
 
 #[cfg(test)]
 mod test {
+
     use crate::{
-        belt_finding::QueueObject,
         graph::wheighted_graph::{
             adjacency_list::WheightedAdjacencyList, shortest_path::dijkstra, WheightedGraph,
         },
-        priority_queue::{BinaryHeap, PriorityQueue},
+        priority_queue::BinaryHeap,
     };
 
     #[test]

src/misc/map.rs

@@ -1,3 +1,4 @@
+#[derive(Clone)]
 pub struct Map<T> {
     pub width: usize,
     pub height: usize,