competitive/combinatorial_optimization/
mod.rs

1use crate::{
2    data_structure::{BitSet, DoublyLinkedList},
3    num::Zero,
4};
5
6#[codesnip::entry("knapsack_problem")]
7pub use self::knapsack_problem::*;
8#[codesnip::entry("largest_pattern")]
9pub use self::largest_pattern::*;
10#[codesnip::entry("levenshtein_distance")]
11pub use self::levenshtein_distance::levenshtein_distance;
12#[codesnip::entry("LexicographicalSubsequence")]
13pub use self::lexicographical_subsequence::LexicographicalSubsequence;
14#[codesnip::entry("LongestIncreasingSubsequence")]
15pub use self::longest_increasing_subsequence::LongestIncreasingSubsequence;
16#[codesnip::entry("maximum_scoring_segment_sets")]
17pub use self::maximum_scoring_segment_sets::maximum_scoring_segment_sets;
18#[codesnip::entry("SubsetSumProblem")]
19pub use self::subset_sum_problem::SubsetSumProblem;
20
21#[cfg_attr(nightly, codesnip::entry("knapsack_problem"))]
22mod knapsack_problem;
23#[cfg_attr(nightly, codesnip::entry("largest_pattern"))]
24mod largest_pattern;
25#[cfg_attr(nightly, codesnip::entry("levenshtein_distance"))]
26mod levenshtein_distance;
27#[cfg_attr(nightly, codesnip::entry("LexicographicalSubsequence"))]
28mod lexicographical_subsequence;
29#[cfg_attr(nightly, codesnip::entry("LongestIncreasingSubsequence"))]
30mod longest_increasing_subsequence;
31#[cfg_attr(
32    nightly,
33    codesnip::entry(
34        "maximum_scoring_segment_sets",
35        include("DoublyLinkedList", "zero_one")
36    )
37)]
38mod maximum_scoring_segment_sets;
39#[cfg_attr(nightly, codesnip::entry("SubsetSumProblem", include("BitSet")))]
40mod subset_sum_problem;
competitive/combinatorial_optimization/mod.rs

competitive/combinatorial_optimization/
mod.rs
