Fixed unnecessary owning of value

src/algorithms/find_width_of_tree_decomposition.rs

@@ -4,7 +4,7 @@ use std::collections::HashSet;
 /// Returns the maximum size of one of the bags in the tree decomposition graph.
 /// This equals the highest len of one of the vertices in the graph. Returns 0 if the graph has no vertices
 pub fn find_width_of_tree_decomposition<E>(
-    graph: Graph<HashSet<NodeIndex>, E, petgraph::prelude::Undirected>,
+    graph: &Graph<HashSet<NodeIndex>, E, petgraph::prelude::Undirected>,
 ) -> usize {
     if let Some(bag) = graph.node_weights().max_by_key(|b| b.len()) {
         bag.len()