permlib
0.2.6
Library for permutation computations
|
subgroup search for a stabilizer of an integer vector based on partition backtracking More...
#include <vector_stabilizer_search.h>
Public Types | |
typedef RBase< BSGSIN, TRANSRET >::PERM | PERM |
Public Member Functions | |
VectorStabilizerSearch (const BSGSIN &bsgs, unsigned int pruningLevelDCM) | |
constructor | |
template<class InputIterator > | |
void | construct (InputIterator begin, InputIterator end, unsigned int maxEntries) |
initializes search | |
Protected Member Functions | |
virtual unsigned int | processNewFixPoints (const Partition &pi, unsigned int backtrackCount) |
callback when a new fix point appears during R-base construction |
subgroup search for a stabilizer of an integer vector based on partition backtracking
permlib::partition::VectorStabilizerSearch< BSGSIN, TRANSRET >::VectorStabilizerSearch | ( | 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::partition::VectorStabilizerSearch< BSGSIN, TRANSRET >::construct | ( | InputIterator | begin, |
InputIterator | end, | ||
unsigned int | maxEntries | ||
) |
initializes search
assume that integer vector has entries 0, 1, ..., maxEntries-1
begin | iterator(unsigned long) begin of the integer vector to be stabilized |
end | iterator(unsigned long) end of the integer vector to be stabilized |
maxEntries | value of maximal entry of integer vector plus 1 |