permlib 0.2.9
Library for permutation computations
|
BSGS construction from a known base and strong generating set. More...
#include <known_bsgs_construction.h>
Public Member Functions | |
KnownBSGSConstruction (unsigned int n) | |
constructor | |
template<class ForwardIterator, class InputIterator> | |
BSGS< PERM, TRANS > | construct (ForwardIterator generatorsBegin, ForwardIterator generatorsEnd, InputIterator knownBaseBegin, InputIterator knownBaseEnd) const |
sets up a BSGS data structure for a known base and strong generating set | |
![]() | |
BaseConstruction (dom_int n) | |
constructor | |
Additional Inherited Members | |
![]() | |
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 | |
![]() | |
dom_int | m_n |
cardinality of the set the group is acting on | |
![]() | |
static const unsigned long * | empty |
auxilliary element marking an empty iterator | |
BSGS construction from a known base and strong generating set.
permlib::KnownBSGSConstruction< PERM, TRANS >::KnownBSGSConstruction | ( | unsigned int | n | ) |
constructor
n | cardinality of the set the group is acting on |
BSGS< PERM, TRANS > permlib::KnownBSGSConstruction< PERM, TRANS >::construct | ( | ForwardIterator | generatorsBegin, |
ForwardIterator | generatorsEnd, | ||
InputIterator | knownBaseBegin, | ||
InputIterator | knownBaseEnd ) const |
sets up a BSGS data structure for a known base and strong generating set