|
permlib
0.2.8
Library for permutation computations
|
subgroup search for a set stabilizer based on partition backtracking More...
#include <set_stabilizer_search.h>
Public Types | |
|
typedef RBase< BSGSIN, TRANSRET >::PERM | PERM |
Public Member Functions | |
| SetStabilizerSearch (const BSGSIN &bsgs, unsigned int pruningLevelDCM) | |
| constructor | |
| template<class InputIterator > | |
| void | construct (InputIterator begin, InputIterator end) |
| 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 set stabilizer based on partition backtracking
| permlib::partition::SetStabilizerSearch< BSGSIN, TRANSRET >::SetStabilizerSearch | ( | 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::SetStabilizerSearch< BSGSIN, TRANSRET >::construct | ( | InputIterator | begin, |
| InputIterator | end | ||
| ) |
initializes search
| begin | iterator(unsigned long) begin of the set to be stabilized |
| end | iterator(unsigned long) end of the set to be stabilized |
1.7.6.1