permlib
0.2.9
Library for permutation computations
|
BSGS construction for a cyclic group of given order. More...
#include <cyclic_group_construction.h>
Public Member Functions | |
CyclicGroupConstruction (unsigned int n) | |
constructor More... | |
BSGS< typename TRANS::PERMtype, TRANS > | construct () const |
sets up a BSGS data structure for a cyclic group | |
![]() | |
KnownBSGSConstruction (unsigned int n) | |
constructor More... | |
BSGS< TRANS::PERMtype, 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 More... | |
![]() | |
BaseConstruction (dom_int n) | |
constructor More... | |
Additional Inherited Members | |
![]() | |
void | setup (ForwardIterator generatorsBegin, ForwardIterator generatorsEnd, InputIterator prescribedBaseBegin, InputIterator prescribedBaseEnd, BSGS< TRANS::PERMtype, TRANS > &bsgs, std::vector< std::list< typename TRANS::PERMtype ::ptr > > &S) const |
initializes BSGS object More... | |
void | mergeGenerators (std::vector< std::list< typename TRANS::PERMtype ::ptr > > &S, BSGS< TRANS::PERMtype, 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 for a cyclic group of given order.
permlib::CyclicGroupConstruction< TRANS >::CyclicGroupConstruction | ( | unsigned int | n | ) |
constructor
n | order of the cyclic group |