From a7737631eb84bafa1d5943dac99d9511b8c5d1fc Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Raoul=20Luqu=C3=A9?= <raoulsluque@gmail.com>
Date: Fri, 10 May 2024 09:30:50 +0200
Subject: [PATCH] Renamed parameter

---
 treewidth_heuristic/src/compute_treewidth_upper_bound.rs | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/treewidth_heuristic/src/compute_treewidth_upper_bound.rs b/treewidth_heuristic/src/compute_treewidth_upper_bound.rs
index 3eb648a..5f130a4 100644
--- a/treewidth_heuristic/src/compute_treewidth_upper_bound.rs
+++ b/treewidth_heuristic/src/compute_treewidth_upper_bound.rs
@@ -23,7 +23,7 @@ pub enum TreewidthComputationMethod {
 pub fn compute_treewidth_upper_bound<N: Clone, E: Clone>(
     graph: &Graph<N, E, Undirected>,
     edge_weight_heuristic: fn(&HashSet<NodeIndex>, &HashSet<NodeIndex>) -> i32,
-    use_predecessor_map_to_fill_bags: TreewidthComputationMethod,
+    treewidth_computation_method: TreewidthComputationMethod,
     check_tree_decomposition_bool: bool,
 ) -> (
     Graph<HashSet<NodeIndex>, i32, Undirected>,
@@ -42,7 +42,7 @@ pub fn compute_treewidth_upper_bound<N: Clone, E: Clone>(
         predecessor_map,
         clique_graph_tree_before_filling,
         clique_graph,
-    ) = match use_predecessor_map_to_fill_bags {
+    ) = match treewidth_computation_method {
         TreewidthComputationMethod::MSTAndUseTreeStructure => {
             let (clique_graph, clique_graph_map) =
                 construct_clique_graph_with_bags(cliques, edge_weight_heuristic);