BSGS construction with classic Schreier-Sims algorithm.
More...
#include <schreier_sims_construction.h>
|
| | 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
|
| | BaseConstruction (dom_int n) |
| | constructor
|
|
|
unsigned int | m_statScheierGeneratorsConsidered |
| | number of Schreier generators examined during the last construct call
|
|
| 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
|
template<class
PERM, class
TRANS>
class permlib::SchreierSimsConstruction< PERM, TRANS >
BSGS construction with classic Schreier-Sims algorithm.
◆ SchreierSimsConstruction()
constructor
- Parameters
-
| n | cardinality of the set the group is acting on |
◆ construct() [1/2]
template<class ForwardIterator>
constructs a BSGS for group given by generators with no base prescribed
- See also
- construct(ForwardIterator generatorsBegin, ForwardIterator generatorsEnd, InputIterator prescribedBaseBegin, InputIterator prescribedBaseEnd)
◆ construct() [2/2]
template<class ForwardIterator, class InputIterator>
constructs a BSGS for group given by generators respecting prescribed base elements
- Parameters
-
| generatorsBegin | begin iterator of group generators of type PERM |
| generatorsEnd | end iterator of group generators of type PERM |
| prescribedBaseBegin | begin iterator of prescribed base of type unsigned long |
| prescribedBaseEnd | end iterator of prescribed base of type unsigned long |
The documentation for this class was generated from the following file: