chore(clippy): enable new lints

Author: Copilot

Cargo.toml

@@ -48,8 +48,8 @@ module_name_repetitions = { level = "allow", priority = 1 }
 too_long_first_doc_paragraph = { level = "allow", priority = 1 } # Temporary
 pedantic = "deny"
 missing_const_for_fn = "deny"
-# Do not activate until Clippy issue #13356 is fixed
-#allow_attributes = "deny"
+redundant_clone = "deny"
+allow_attributes = "deny"
 
 [[bench]]
 name = "algos"

examples/sliding-puzzle.rs

@@ -12,8 +12,8 @@ const SIDE: u8 = 3;
 const SIDE: u8 = 4;
 const LIMIT: usize = (SIDE * SIDE) as usize;
 
+#[expect(clippy::derived_hash_with_manual_eq)]
 #[derive(Clone, Debug, Hash)]
-#[allow(clippy::derived_hash_with_manual_eq)] // expect doesn't work, clippy issue #13356
 struct Game {
     positions: [u8; LIMIT], // Correct position of piece at every index
     hole_idx: u8,           // Current index of the hole

src/directed/bfs.rs

@@ -172,7 +172,7 @@ where
 ///
 /// Find also a more interesting example, comparing regular
 /// and bidirectional BFS [here](https://github.com/evenfurther/pathfinding/blob/main/examples/bfs_bidirectional.rs).
-#[allow(clippy::missing_panics_doc)]
+#[expect(clippy::missing_panics_doc)]
 pub fn bfs_bidirectional<'a, N, S, E, FNS, FNP, IN>(
     start: S,
     end: E,

tests/matrix.rs

@@ -169,7 +169,7 @@ fn square_rotate() {
     let mut m = m1.clone();
     m.rotate_ccw(2);
     assert_eq!(m, m3);
-    let mut m = m1.clone();
+    let mut m = m1;
     m.rotate_ccw(3);
     assert_eq!(m, m2);
 

tests/pathfinding.rs

@@ -335,7 +335,7 @@ mod ex2 {
 
     #[test]
     fn bfs_bidirectional_path_ok() {
-        #[allow(clippy::type_complexity)]
+        #[expect(clippy::type_complexity)]
         static SUCCESSORS: fn(&(usize, usize)) -> Vec<(usize, usize)> =
             |n| successors(n).into_iter().map(|(n, _)| n).collect();
 
@@ -420,7 +420,7 @@ mod ex2 {
 
     #[test]
     fn bfs_bidirectional_no_path() {
-        #[allow(clippy::type_complexity)]
+        #[expect(clippy::type_complexity)]
         static SUCCESSORS: fn(&(usize, usize)) -> Vec<(usize, usize)> =
             |n| successors(n).into_iter().map(|(n, _)| n).collect();