permlib
0.2.9
Library for permutation computations
|
base change by constructing a new base with random schreier sims More...
#include <new_base_change.h>
Public Member Functions | |
NewBaseChange (const BSGS< PERM, TRANS > &bsgs) | |
constructor | |
~NewBaseChange () | |
destructor | |
template<class InputIterator > | |
void | change (BSGS< PERM, TRANS > &bsgs, InputIterator baseBegin, InputIterator baseEnd, bool skipRedundant=false) const |
changes base of bsgs so that it starts with the sequence given by baseBegin to baseEnd | |
![]() | |
BaseChange () | |
constructor | |
Additional Inherited Members | |
![]() | |
unsigned int | m_statTranspositions |
nuber of base transpositions needed since construction | |
unsigned int | m_statScheierGeneratorsConsidered |
nuber of Schreier generators considered in transposition since construction | |
![]() | |
bool | isRedundant (const BSGSCore< PERM, TRANS > &bsgs, unsigned int baseTargetPos, unsigned long alpha) const |
checks if insertion of a base point at given position is redundant More... | |
base change by constructing a new base with random schreier sims