From 65fef1d30298a7f457f0d4b7bee538be1919bd15 Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?Raoul=20Luqu=C3=A9?= Date: Wed, 3 Jul 2024 18:31:07 +0200 Subject: [PATCH] Redo visibility of modules --- src/compute_treewidth_upper_bound.rs | 3 ++- src/{find_maximum_cliques.rs => find_maximal_cliques.rs} | 0 src/lib.rs | 3 +-- 3 files changed, 3 insertions(+), 3 deletions(-) rename src/{find_maximum_cliques.rs => find_maximal_cliques.rs} (100%) diff --git a/src/compute_treewidth_upper_bound.rs b/src/compute_treewidth_upper_bound.rs index 9ffc919..67fa68e 100644 --- a/src/compute_treewidth_upper_bound.rs +++ b/src/compute_treewidth_upper_bound.rs @@ -1,13 +1,14 @@ +use petgraph::{graph::NodeIndex, Graph, Undirected}; use std::{ collections::{HashMap, HashSet}, fmt::Debug, hash::BuildHasher, }; -use petgraph::{graph::NodeIndex, Graph, Undirected}; use crate::*; use construct_clique_graph::*; use fill_bags_along_paths::*; +use find_maximal_cliques::*; use find_width_of_tree_decomposition::find_width_of_tree_decomposition; /// Different methods for computing the spanning tree of the clique graph that is used as the base diff --git a/src/find_maximum_cliques.rs b/src/find_maximal_cliques.rs similarity index 100% rename from src/find_maximum_cliques.rs rename to src/find_maximal_cliques.rs diff --git a/src/lib.rs b/src/lib.rs index 90a8c58..bfe1574 100644 --- a/src/lib.rs +++ b/src/lib.rs @@ -5,7 +5,7 @@ pub mod construct_clique_graph; pub mod fill_bags_along_paths; mod fill_bags_while_generating_mst; mod find_connected_components; -mod find_maximum_cliques; +pub mod find_maximal_cliques; pub mod find_width_of_tree_decomposition; mod generate_partial_k_tree; mod maximum_minimum_degree_heuristic; @@ -22,7 +22,6 @@ pub(crate) use fill_bags_while_generating_mst::{ fill_bags_while_generating_mst_update_edges, fill_bags_while_generating_mst_using_tree, }; pub(crate) use find_connected_components::find_connected_components; -pub(crate) use find_maximum_cliques::{find_maximal_cliques, find_maximum_cliques_bounded}; pub use generate_partial_k_tree::{ generate_k_tree, generate_partial_k_tree, generate_partial_k_tree_with_guaranteed_treewidth, };