refactor(11/2025): try to solve it counting parts lengths - still fail

Author: manhunto

src/solutions/year2025/day11.rs

@@ -1,7 +1,6 @@
 use crate::solutions::Solution;
 use crate::utils::graphs::all_paths::AllPaths;
 use crate::utils::graphs::graph::Graph;
-use std::collections::VecDeque;
 
 pub struct Day11;
 
@@ -21,14 +20,23 @@ impl Solution for Day11 {
 
     fn part_two(&self, input: &str) -> String {
         let graph = self.parse(input);
+        // todo reverse graph for directed only
+        // if undirected it is just the same?
         let all_paths: AllPaths<&str> = (&graph).into();
 
-        let should_count_path =
-            |path: &VecDeque<&str>| path.contains(&LABEL_DAC) && path.contains(&LABEL_FFT);
+        // find depth of every path and then pass it as parameter
 
-        all_paths
-            .count_paths(LABEL_SVR, LABEL_OUT, should_count_path)
-            .to_string()
+        let svr_dac = all_paths.count_paths(LABEL_SVR, LABEL_DAC);
+        let dac_fft = all_paths.count_paths(LABEL_DAC, LABEL_FFT);
+        let fft_out = all_paths.count_paths(LABEL_FFT, LABEL_OUT);
+        let svr_dac_fft_out = svr_dac * dac_fft * fft_out;
+
+        let svr_fft = all_paths.count_paths(LABEL_SVR, LABEL_FFT);
+        let fft_dac = all_paths.count_paths(LABEL_FFT, LABEL_DAC);
+        let dac_out = all_paths.count_paths(LABEL_DAC, LABEL_OUT);
+        let scr_fft_dac_out = svr_fft * fft_dac * dac_out;
+
+        (svr_dac_fft_out + scr_fft_dac_out).to_string()
     }
 }
 

src/utils/graphs/all_paths.rs

@@ -90,7 +90,14 @@ where
         visited.remove(&from);
     }
 
-    pub fn count_paths<E>(
+    pub fn count_paths<E>(&self, start: T, end: E) -> usize
+    where
+        E: IsEnd<T>,
+    {
+        self.count_paths_with_condition(start, end, |_: &VecDeque<T>| true)
+    }
+
+    pub fn count_paths_with_condition<E>(
         &self,
         start: T,
         end: E,
@@ -122,6 +129,8 @@ where
         visited.insert(from); // probably is not needed for graph
         path.push_back(from);
 
+        println!("{} {:?}", path.len(), path);
+
         if end.is_end(&from) {
             if should_count_path(path) {
                 count += 1;