permlib
0.2.6
Library for permutation computations
|
coset representative search for a set image based on classical backtracking More...
#include <set_image_search.h>
Public Types | |
typedef BacktrackSearch < BSGSIN, TRANSRET >::PERM | PERM |
Public Member Functions | |
SetImageSearch (const BSGSIN &bsgs, unsigned int pruningLevelDCM) | |
constructor | |
template<class InputIterator > | |
void | construct (InputIterator begin, InputIterator end, InputIterator beginImg, InputIterator endImg) |
initializes search |
coset representative search for a set image based on classical backtracking
tries to find a such that
for two given sets
permlib::classic::SetImageSearch< BSGSIN, TRANSRET >::SetImageSearch | ( | 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::SetImageSearch< BSGSIN, TRANSRET >::construct | ( | InputIterator | begin, |
InputIterator | end, | ||
InputIterator | beginImg, | ||
InputIterator | endImg | ||
) |
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 ![]() |