Fixed unnecessary moving of value

RaoulLuque · Apr 7, 2024 · f6d6eb0 · f6d6eb0
1 parent cdbf13d
commit f6d6eb0
Show file tree

Hide file tree

Showing 2 changed files with 3 additions and 3 deletions.
diff --git a/src/algorithms.rs b/src/algorithms.rs
@@ -1,5 +1,5 @@
 pub mod construct_clique_graph;
-pub mod fill_bags_along_path;
+pub mod fill_bags_along_paths;
 pub mod find_maximum_cliques;
 pub mod find_path_in_tree;
 pub mod find_width_of_tree_decomposition;
diff --git a/src/algorithms/fill_bags_along_path.rs → src/algorithms/fill_bags_along_paths.rs b/src/algorithms/fill_bags_along_path.rs → src/algorithms/fill_bags_along_paths.rs
@@ -9,8 +9,8 @@ use std::collections::HashSet;
 
 /// Given a tree graph with bags (HashSets) as Vertices, checks all 2-combinations of bags for non-empty-intersection
 /// and inserts the intersecting nodes in all bags that are along the (unique) path of the two bags in the tree.
-pub fn fill_bags_along_path<E>(
-    mut graph: Graph<HashSet<NodeIndex>, E, petgraph::prelude::Undirected>,
+pub fn fill_bags_along_paths<E>(
+    graph: &mut Graph<HashSet<NodeIndex>, E, petgraph::prelude::Undirected>,
 ) {
     let mut vec_of_bags_that_need_to_be_connected: Vec<(NodeIndex, NodeIndex, Vec<NodeIndex>)> =
         Vec::new();