Module combinatorial 

Re-exports

pub use backtracking::combinations;

pub use backtracking::permutations;

pub use dancing_links::DancingLinks;

pub use gray_code::gray_code;

pub use johnson_trotter::johnson_trotter;

pub use subset_gen::power_set;

pub use subset_gen::power_set_iter;

pub use subset_gen::PowerSet;

pub use zassenhaus::schur_zassenhaus;

pub use zassenhaus::Permutation;

pub use zassenhaus::PermutationGroup;

Modules

backtracking

dancing_links

gray_code

Generate an n-bit Gray code sequence using the standard i ^ (i >> 1) method. Returns a Vec of length 2^n, where each element is the Gray code for i in [0 .. 2^n).

johnson_trotter

Johnson-Trotter permutation generator in Rust. Produces all permutations of distinct items in “adjacent swap” (Johnson-Trotter) order.

subset_gen

Module for generating the power set (all subsets) of a slice using binary representation.

zassenhaus

A self-contained, demonstrative (but general) Schur–Zassenhaus (Zassenhaus) algorithm in Rust. This example works with finite groups given as subgroups of the symmetric group S_n (i.e., as sets of permutations over {0..n-1}). It shows how to: