Module combinatorial_optimization 

Modules

knapsack_problem 🔒

largest_pattern 🔒

levenshtein_distance 🔒

lexicographical_subsequence 🔒

longest_increasing_subsequence 🔒

maximum_scoring_segment_sets 🔒

subset_sum_problem 🔒

Structs

KnapsackProblemSmallValue

KnapsackProblemSmallWeight

LexicographicalSubsequence

LongestIncreasingSubsequence

SubsetSumProblem

ZeroOneKnapsackProblemBranchAndBound

ZeroOneKnapsackProblemSmallItems

Functions

largest_rectangle

largest_rectangle_in_grid

largest_square

levenshtein_distance

maximum_scoring_segment_sets

Returns the maximum total score of exactly k nonempty disjoint segments for each k.