Skip to content

Commit

Permalink
Made generate_k_tree public
Browse files Browse the repository at this point in the history
  • Loading branch information
RaoulLuque committed Jun 26, 2024
1 parent fd9035b commit caadfef
Show file tree
Hide file tree
Showing 2 changed files with 2 additions and 2 deletions.
2 changes: 1 addition & 1 deletion src/generate_partial_k_tree.rs
Original file line number Diff line number Diff line change
Expand Up @@ -71,7 +71,7 @@ pub fn generate_partial_k_tree(

/// Generates a [k-tree](https://en.wikipedia.org/wiki/K-tree) with n vertices and k in the definition.
/// Returns None if k > n
pub(crate) fn generate_k_tree(k: usize, n: usize) -> Option<Graph<i32, i32, Undirected>> {
pub fn generate_k_tree(k: usize, n: usize) -> Option<Graph<i32, i32, Undirected>> {
if k > n {
None
} else {
Expand Down
2 changes: 1 addition & 1 deletion src/lib.rs
Original file line number Diff line number Diff line change
Expand Up @@ -30,7 +30,7 @@ pub(crate) use find_connected_components::find_connected_components;
pub(crate) use find_maximum_cliques::{find_maximum_cliques, find_maximum_cliques_bounded};
pub(crate) use find_width_of_tree_decomposition::find_width_of_tree_decomposition;
pub use generate_partial_k_tree::{
generate_partial_k_tree, generate_partial_k_tree_with_guaranteed_treewidth,
generate_k_tree, generate_partial_k_tree, generate_partial_k_tree_with_guaranteed_treewidth,
};
pub(crate) use maximum_minimum_degree_heuristic::maximum_minimum_degree_plus;

Expand Down

0 comments on commit caadfef

Please sign in to comment.