Fix code formatting

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

Author: Copilot

tests/cycle_detection.rs

@@ -40,27 +40,27 @@ fn brent_partial_works() {
 fn partial_functions_match_full_functions() {
     // Test that partial functions return the same lambda as full functions
     let f = |x| (x + 5) % 6 + 3;
-    
+
     let (lam_floyd, elem_floyd, mu_floyd) = floyd(-10, f);
     let (lam_floyd_partial, elem_floyd_partial, mu_tilde_floyd) = floyd_partial(-10, f);
-    
+
     let (lam_brent, elem_brent, mu_brent) = brent(-10, f);
     let (lam_brent_partial, elem_brent_partial, mu_tilde_brent) = brent_partial(-10, f);
-    
+
     // Lambda should be the same
     assert_eq!(lam_floyd, lam_floyd_partial);
     assert_eq!(lam_brent, lam_brent_partial);
     assert_eq!(lam_floyd, lam_brent);
-    
+
     // Elements should be in the cycle
     assert!([4, 6, 8].contains(&elem_floyd));
     assert!([4, 6, 8].contains(&elem_floyd_partial));
     assert!([4, 6, 8].contains(&elem_brent));
     assert!([4, 6, 8].contains(&elem_brent_partial));
-    
+
     // Mu values from full algorithms should be the same
     assert_eq!(mu_floyd, mu_brent);
-    
+
     // Mu_tilde should be valid upper bounds
     assert!(mu_floyd <= mu_tilde_floyd);
     assert!(mu_tilde_floyd < mu_floyd + lam_floyd);