diff --git a/factorio-pathfinding/src/belt_finding/conflict_avoidance.rs b/factorio-pathfinding/src/belt_finding/conflict_avoidance.rs
index 0883e5d..7e91083 100644
--- a/factorio-pathfinding/src/belt_finding/conflict_avoidance.rs
+++ b/factorio-pathfinding/src/belt_finding/conflict_avoidance.rs
@@ -259,7 +259,7 @@ impl ConflictAvoidance {
 
         let mut b = b.build();
 
-        // self.print_visualization();
+        // b.print_visualization();
 
         let mut min_cost = f64::INFINITY;
         let mut solutions = Vec::new();
@@ -267,6 +267,7 @@ impl ConflictAvoidance {
         while b.next_finish_state(timeout) {
             // println!("{}", b);
             // b.print();
+            b.print_visualization();
             let c = b.cost();
             if c < min_cost {
                 min_cost = c;
diff --git a/factorio-pathfinding/src/belt_finding/mod.rs b/factorio-pathfinding/src/belt_finding/mod.rs
index 53fa4dc..d271cdf 100644
--- a/factorio-pathfinding/src/belt_finding/mod.rs
+++ b/factorio-pathfinding/src/belt_finding/mod.rs
@@ -4,6 +4,7 @@ use crate::misc::Map;
 use crate::priority_queue::BinaryHeap;
 use crate::Connection;
 use crate::Map as _;
+use crate::SinglePathInput;
 use crate::{graph::wheighted_graph::shortest_path::dijkstra, SinglePathfinder};
 use factorio_core::{prelude::*, visualize::Visualize};
 use serde::{Deserialize, Serialize};
@@ -17,23 +18,22 @@ pub struct ConflictAvoidance {
 }
 
 impl SinglePathfinder for ConflictAvoidance {
-    fn find_paths(
+    fn find_paths<M: crate::Map>(
         &self,
-        input: &[crate::SingleConnection],
-        map: impl crate::Map,
+        input: SinglePathInput<'_, M>,
     ) -> Option<Vec<Vec<factorio_core::pathfield::PathField>>> {
-        let (pos, size) = map.area();
+        let (pos, size) = input.map.area();
         let mut p = Problem::new(size.x as usize, size.y as usize);
 
         for x in 0..size.x {
             for y in 0..size.y {
-                if !map.get_position(Position::new(x - pos.x, y - pos.y)) {
+                if !input.map.get_position(Position::new(x - pos.x, y - pos.y)) {
                     p.set_blocked(x as usize, y as usize, true);
                 }
             }
         }
 
-        for i in input {
+        for i in input.connections {
             p.add_connection((i.start_pos, i.start_dir), (i.end_pos, i.end_dir));
         }
 
@@ -109,7 +109,7 @@ impl Problem {
         for (i, path) in self.path.iter().enumerate() {
             if i != without {
                 for p in path {
-                    let weight = 1.0;
+                    let weight = 10.0;
                     let x = p.0.x as usize;
                     let y = p.0.y as usize;
 
diff --git a/factorio-pathfinding/src/bin/beltfinding.rs b/factorio-pathfinding/src/bin/beltfinding.rs
index 2d8bd96..cc08108 100644
--- a/factorio-pathfinding/src/bin/beltfinding.rs
+++ b/factorio-pathfinding/src/bin/beltfinding.rs
@@ -76,6 +76,7 @@ fn main() {
         Mode::ConflictAvoidance => {
             p.print_visualization();
             p.find_path();
+            p.print_visualization();
             p.find_path();
             p.print_visualization();
             let mut c = ConflictAvoidance::new(&p);
diff --git a/factorio-pathfinding/src/lib.rs b/factorio-pathfinding/src/lib.rs
index 8eeefdc..30ab709 100644
--- a/factorio-pathfinding/src/lib.rs
+++ b/factorio-pathfinding/src/lib.rs
@@ -6,6 +6,11 @@ pub mod graph;
 pub mod misc;
 pub mod priority_queue;
 
+pub struct PathInput<'c, M> {
+    connections: &'c [Connection],
+    map: M,
+}
+
 pub struct Connection {
     pub start_pos: Position,
     pub start_dir: Direction,
@@ -23,7 +28,12 @@ pub trait Map {
 }
 
 pub trait Pathfinder {
-    fn find_paths(&self, input: &[Connection], map: impl Map) -> Option<Vec<Vec<PathField>>>;
+    fn find_paths<M: Map>(&self, input: PathInput<'_, M>) -> Option<Vec<Vec<PathField>>>;
+}
+
+pub struct SinglePathInput<'c, M> {
+    connections: &'c [SingleConnection],
+    map: M,
 }
 
 struct SingleConnection {
@@ -35,15 +45,16 @@ struct SingleConnection {
 }
 
 trait SinglePathfinder {
-    fn find_paths(&self, input: &[SingleConnection], map: impl Map) -> Option<Vec<Vec<PathField>>>;
+    fn find_paths<M: Map>(&self, input: SinglePathInput<'_, M>) -> Option<Vec<Vec<PathField>>>;
 }
 
 impl<P> Pathfinder for P
 where
     P: SinglePathfinder,
 {
-    fn find_paths(&self, input: &[Connection], map: impl Map) -> Option<Vec<Vec<PathField>>> {
+    fn find_paths<M: Map>(&self, input: PathInput<'_, M>) -> Option<Vec<Vec<PathField>>> {
         let inner_input = input
+            .connections
             .iter()
             .flat_map(|c| {
                 (0..c.lanes).map(|i| SingleConnection {
@@ -60,12 +71,16 @@ where
             })
             .collect::<Vec<_>>();
 
-        let inner_result = self.find_paths(&inner_input, map)?;
+        let inner_result = self.find_paths(SinglePathInput {
+            connections: &inner_input,
+            map: input.map,
+        })?;
 
         let mut inner_iterator = inner_result.into_iter();
 
         Some(
             input
+                .connections
                 .iter()
                 .map(|i| inner_iterator.by_ref().take(i.lanes).flatten().collect())
                 .collect(),