Avoid messages, store edges to send

leo848 · Apr 6, 2024 · dee5678 · dee5678
1 parent aa86fed
commit dee5678
Showing 1 changed file with 18 additions and 18 deletions.
diff --git a/src/path/create/ilp.rs b/src/path/create/ilp.rs
@@ -13,6 +13,8 @@ pub fn solve<C: CreateContext>(ctx: C) -> C::Path {
     let node_indices = { || (0..size) };
 
     let mut model = Model::default();
+    model.set_parameter("messages", "off");
+
     model.set_obj_sense(Sense::Minimize);
 
     let x: Vec<Vec<Col>> = {
@@ -96,24 +98,22 @@ pub fn solve<C: CreateContext>(ctx: C) -> C::Path {
     let mut paths = print_paths_solution(&mut model, &x);
 
     while paths.len() > 1 {
-        ctx.send_edges(
-            paths
-                .iter()
-                .flat_map(|path| {
-                    path.iter().tuple_windows::<(_, _)>().chain(
-                        if path[0] == path[path.len() - 1] {
-                            vec![(&path[path.len() - 1], &path[0])]
-                        } else {
-                            vec![]
-                        },
-                    )
-                })
-                .map(|(&i, &j)| (i, j))
-                .filter(|(i, j)| i != j)
-                .sorted()
-                .dedup(),
-            None,
-        );
+        let edges_to_send = paths
+            .iter()
+            .flat_map(|path| {
+                path.iter()
+                    .tuple_windows::<(_, _)>()
+                    .chain(if path[0] == path[path.len() - 1] {
+                        vec![(&path[path.len() - 1], &path[0])]
+                    } else {
+                        vec![]
+                    })
+            })
+            .map(|(&i, &j)| (i, j))
+            .filter(|(i, j)| i != j)
+            .sorted()
+            .dedup();
+        ctx.send_edges(edges_to_send, None);
         add_cycle_constraints(&mut model, &paths, &x);
         paths = print_paths_solution(&mut model, &x);
     }