permlib
0.2.6
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 |
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
generatorsBegin | begin iterator of strong generating set of type PERM |
generatorsEnd | end iterator of strong generating set of type PERM |
knownBaseBegin | begin iterator of known base of type unsigned long |
knownBaseEnd | end iterator of known base of type unsigned long |