diff --git a/src/algorithms/find_width_of_tree_decomposition.rs b/src/algorithms/find_width_of_tree_decomposition.rs
index ce085b5..6c4d88b 100644
--- a/src/algorithms/find_width_of_tree_decomposition.rs
+++ b/src/algorithms/find_width_of_tree_decomposition.rs
@@ -3,7 +3,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_decompositionpub<E>(
+pub fn find_width_of_tree_decomposition<E>(
     graph: Graph<HashSet<NodeIndex>, E, petgraph::prelude::Undirected>,
 ) -> usize {
     if let Some(bag) = graph.node_weights().max_by_key(|b| b.len()) {