Day 12-1

src/day_12_1/mod.rs

@@ -48,9 +48,9 @@ pub fn solve(heights: &Vec<Vec<char>>) -> u32 {
     let start = start.expect("Expected a start node!");
     let end = end.expect("Expected an end node!");
 
-    let shortest_path = algo::dijkstra(&graph, start, Some(end), |_| 1);
+    let dijkstra = algo::dijkstra(&graph, start, Some(end), |_| 1);
 
-    shortest_path.len() as u32
+    dijkstra[&end]
 }
 
 fn add_edges(graph: &mut Graph<char, ()>, nodes: &Vec<Vec<NodeIndex>>, y: usize, x: usize) {