permlib
0.2.6
Library for permutation computations
|
coset representative search for a lex-smaller set images More...
#include <lex_smaller_image_search.h>
Public Types | |
typedef BacktrackSearch < BSGSIN, TRANSRET >::PERM | PERM |
Public Member Functions | |
LexSmallerImageSearch (const BSGSIN &bsgs, unsigned int pruningLevelDCM) | |
constructor | |
template<class InputIteratorZ , class InputIteratorO > | |
void | construct (InputIteratorZ zerosBegin, InputIteratorZ zerosEnd, InputIteratorO onesBegin, InputIteratorO onesEnd) |
initializes search |
coset representative search for a lex-smaller set images
tries to find a such that
permlib::classic::LexSmallerImageSearch< BSGSIN, TRANSRET >::LexSmallerImageSearch | ( | const BSGSIN & | bsgs, |
unsigned int | pruningLevelDCM | ||
) |
constructor
bsgs | BSGS of group |
pruningLevelDCM | level up to which expensive double coset minimality pruning is performed; zero to disable |
void permlib::classic::LexSmallerImageSearch< BSGSIN, TRANSRET >::construct | ( | InputIteratorZ | zerosBegin, |
InputIteratorZ | zerosEnd, | ||
InputIteratorO | onesBegin, | ||
InputIteratorO | onesEnd | ||
) |
initializes search
begin | iterator(unsigned long) begin of the set ![]() |
end | iterator(unsigned long) end of the set ![]() |
beginImg | iterator(unsigned long) begin of the set ![]() |
endImg | iterator(unsigned long) end of the set ![]() |