Module algorithm

Module algorithm 

Source
Expand description

algorithm

Re-exportsยง

Modulesยง

automata_learning ๐Ÿ”’
baby_step_giant_step ๐Ÿ”’
binary_search ๐Ÿ”’
bitdp ๐Ÿ”’
cartesian_tree ๐Ÿ”’
chromatic_number ๐Ÿ”’
combinations ๐Ÿ”’
convex_hull_trick ๐Ÿ”’
esper ๐Ÿ”’
horn_satisfiability ๐Ÿ”’
impartial_game ๐Ÿ”’
mo_algorithm ๐Ÿ”’
other ๐Ÿ”’
partisan_game ๐Ÿ”’
quotient_index ๐Ÿ”’
rho_path ๐Ÿ”’
solve_01_on_tree ๐Ÿ”’
sort ๐Ÿ”’
sqrt_decomposition ๐Ÿ”’
stern_brocot_tree ๐Ÿ”’
syakutori ๐Ÿ”’
ternary_search
xorbasis ๐Ÿ”’
zero_sum_game ๐Ÿ”’

Structsยง

BlackBoxAutomatonImpl
CartesianTree
CeilQuotientIndex
sorted({ ceil(n/k) | k in [1, n] })
Combinations
ConvexHullTrick
DeterministicFiniteAutomaton
DfaLearning
EsperEstimator
EsperSolver
FloorQuotientIndex
sorted({ floor(n/k) | k in [1, n] })
HornSatisfiability
Horn Satisfiability
ImpartialGameAnalyzer
ImpartialGamer
IndependentSubSet
PartisanGameAnalyzer
PartisanGamer
RangeUpdateRangeFoldSqrtDecomposition
RhoPath
$P_0 =$ init, $P_{i+1} = next(P_i)$
SbtNode
SbtPath
SqrtDecompositionBuckets
Subsets
WeightedFiniteAutomaton
WfaLearning
XorBasis
Basis of xor operation.
ZeroSumGameAnalyzer
ZeroSumGamer

Traitsยง

Bisect
binary search helper
BitDpExt
BlackBoxAutomaton
ImpartialGame
PartisanGame
SliceBisectExt
binary search for slice
SliceCombinationsExt
SliceSortExt
SqrtDecomposition
SternBrocotTree
ZeroSumGame

Functionsยง

baby_step_giant_step
$\min{0\le i < n | x^i=y}$
binary_search
binary search for monotone segment
dense_sampling
parallel_binary_search
random_sampling
rational_binary_search
run_length_encoding
return: [(elem, length)]
solve_01_on_tree