From ff12c318f8f81e18a403c782d874118ef4d742c2 Mon Sep 17 00:00:00 2001
From: RaoulLuque <raoulsluque@gmail.com>
Date: Tue, 25 Jun 2024 22:20:59 +0200
Subject: [PATCH] Comment out debug prints

---
 src/fill_bags_while_generating_mst.rs | 48 +++++++++++++++------------
 1 file changed, 26 insertions(+), 22 deletions(-)

diff --git a/src/fill_bags_while_generating_mst.rs b/src/fill_bags_while_generating_mst.rs
index e27634d..65518d7 100644
--- a/src/fill_bags_while_generating_mst.rs
+++ b/src/fill_bags_while_generating_mst.rs
@@ -43,13 +43,16 @@ pub fn fill_bags_while_generating_mst<N, E, O: Ord, S: Default + BuildHasher + C
     let mut current_treewidth = 0;
 
     while !clique_graph_remaining_vertices.is_empty() {
-        println!(
-            "{} vertices remaining",
-            clique_graph_remaining_vertices.len()
-        );
+        // DEBUG
+        // println!(
+        //     "{} vertices remaining",
+        //     clique_graph_remaining_vertices.len()
+        // );
+
         if current_treewidth != crate::find_width_of_tree_decomposition(&result_graph) {
             current_treewidth = crate::find_width_of_tree_decomposition(&result_graph);
-            println!("Max bagsize increased to: {}", current_treewidth + 1);
+            // DEBUG
+            // println!("Max bagsize increased to: {}", current_treewidth + 1);
         }
         // The cheapest_old_vertex_res is one of the vertices from the already constructed tree that the new vertex
         // is being attached to
@@ -71,23 +74,24 @@ pub fn fill_bags_while_generating_mst<N, E, O: Ord, S: Default + BuildHasher + C
                 .clone(),
         );
 
-        println!(
-            "Number of vertices not in intersection with new vertex is: {} of total {}",
-            result_graph
-                .node_weight(cheapest_new_vertex_res)
-                .unwrap()
-                .len()
-                - result_graph
-                    .node_weight(cheapest_old_vertex_res)
-                    .unwrap()
-                    .intersection(result_graph.node_weight(cheapest_new_vertex_res).unwrap())
-                    .collect_vec()
-                    .len(),
-            result_graph
-                .node_weight(cheapest_new_vertex_res)
-                .unwrap()
-                .len()
-        );
+        // DEBUG
+        // println!(
+        //     "Number of vertices not in intersection with new vertex is: {} of total {}",
+        //     result_graph
+        //         .node_weight(cheapest_new_vertex_res)
+        //         .unwrap()
+        //         .len()
+        //         - result_graph
+        //             .node_weight(cheapest_old_vertex_res)
+        //             .unwrap()
+        //             .intersection(result_graph.node_weight(cheapest_new_vertex_res).unwrap())
+        //             .collect_vec()
+        //             .len(),
+        //     result_graph
+        //         .node_weight(cheapest_new_vertex_res)
+        //         .unwrap()
+        //         .len()
+        // );
 
         node_index_map.insert(cheapest_new_vertex_clique, cheapest_new_vertex_res);
         result_graph.add_edge(