permlib 0.2.9
Library for permutation computations
|
BSGS construction with classic Schreier-Sims algorithm. More...
#include <schreier_sims_construction.h>
Public Member Functions | |
SchreierSimsConstruction (unsigned int n) | |
constructor | |
template<class ForwardIterator> | |
BSGS< PERM, TRANS > | construct (ForwardIterator generatorsBegin, ForwardIterator generatorsEnd) const |
constructs a BSGS for group given by generators with no base prescribed | |
template<class ForwardIterator, class InputIterator> | |
BSGS< PERM, TRANS > | construct (ForwardIterator generatorsBegin, ForwardIterator generatorsEnd, InputIterator prescribedBaseBegin, InputIterator prescribedBaseEnd) const |
constructs a BSGS for group given by generators respecting prescribed base elements | |
Public Member Functions inherited from permlib::BaseConstruction< PERM, TRANS > | |
BaseConstruction (dom_int n) | |
constructor |
Public Attributes | |
unsigned int | m_statScheierGeneratorsConsidered |
number of Schreier generators examined during the last construct call |
Additional Inherited Members | |
Protected Member Functions inherited from permlib::BaseConstruction< PERM, TRANS > | |
template<class ForwardIterator, class InputIterator> | |
void | setup (ForwardIterator generatorsBegin, ForwardIterator generatorsEnd, InputIterator prescribedBaseBegin, InputIterator prescribedBaseEnd, BSGS< PERM, TRANS > &bsgs, std::vector< std::list< typename PERM::ptr > > &S) const |
initializes BSGS object | |
void | mergeGenerators (std::vector< std::list< typename PERM::ptr > > &S, BSGS< PERM, TRANS > &ret) const |
merges all strong generators in S into a single strong generating set ret.S | |
Protected Attributes inherited from permlib::BaseConstruction< PERM, TRANS > | |
dom_int | m_n |
cardinality of the set the group is acting on | |
Static Protected Attributes inherited from permlib::BaseConstruction< PERM, TRANS > | |
static const unsigned long * | empty |
auxilliary element marking an empty iterator |
BSGS construction with classic Schreier-Sims algorithm.
|
explicit |
constructor
n | cardinality of the set the group is acting on |
|
inline |
constructs a BSGS for group given by generators with no base prescribed
BSGS< PERM, TRANS > permlib::SchreierSimsConstruction< PERM, TRANS >::construct | ( | ForwardIterator | generatorsBegin, |
ForwardIterator | generatorsEnd, | ||
InputIterator | prescribedBaseBegin, | ||
InputIterator | prescribedBaseEnd ) const |
constructs a BSGS for group given by generators respecting prescribed base elements