Removed unnecessary imports

RaoulLuque · May 26, 2024 · 92dcf32 · 92dcf32
1 parent b8a30b4
commit 92dcf32
Show file tree

Hide file tree

Showing 2 changed files with 3 additions and 8 deletions.
diff --git a/treewidth_heuristic/src/compute_treewidth_upper_bound.rs b/treewidth_heuristic/src/compute_treewidth_upper_bound.rs
@@ -5,7 +5,6 @@ use std::{
 };
 
 use crate::*;
-use itertools::Itertools;
 use petgraph::{graph::NodeIndex, Graph, Undirected};
 
 #[derive(Clone, Copy, Debug, PartialEq, Eq, PartialOrd, Ord)]

diff --git a/treewidth_heuristic/src/maximum_minimum_degree_heuristic.rs b/treewidth_heuristic/src/maximum_minimum_degree_heuristic.rs
@@ -1,11 +1,7 @@
-use std::{collections::HashSet, hash::Hash};
+use std::collections::HashSet;
 
-use itertools::{min, Itertools};
-use petgraph::{
-    graph::NodeIndex,
-    visit::{GetAdjacencyMatrix, IntoNeighbors, IntoNodeIdentifiers},
-    Graph, Undirected,
-};
+use itertools::Itertools;
+use petgraph::{graph::NodeIndex, visit::IntoNodeIdentifiers, Graph, Undirected};
 
 /// Computes the contraction degeneracy of the given graph according to https://link.springer.com/chapter/10.1007/978-3-540-30140-0_56 (see MMD+: least-c)
 pub fn maximum_minimum_degree_plus<N: Clone + Default, E: Clone + Default>(