92 ::construct(ForwardIterator generatorsBegin, ForwardIterator generatorsEnd, InputIterator prescribedBaseBegin, InputIterator prescribedBaseEnd)
const
94 const dom_int &n = this->m_n;
96 std::vector<dom_int> &B = ret.
B;
97 std::vector<TRANS> &U = ret.
U;
98 std::vector<std::list<typename PERM::ptr> > S;
99 this->setup(generatorsBegin, generatorsEnd, prescribedBaseBegin, prescribedBaseEnd, ret, S);
101 std::vector<boost::shared_ptr<SchreierGenerator<PERM, TRANS> > > SchreierGens;
102 for (
unsigned int i = 0; i < B.size(); ++i) {
103 BOOST_ASSERT( i < U.size() );
104 BOOST_ASSERT( i < S.size() );
108 unsigned int j = B.size();
109 bool breakUp =
false;
113 sg.
update(&U[j-1], S[j-1].begin(), S[j-1].end());
116 ++m_statScheierGeneratorsConsidered;
117 PERMLIB_DEBUG(
for(
unsigned int jjj=0; jjj<j; ++jjj) std::cout <<
" ";)
118 PERMLIB_DEBUG(std::cout <<
"schreier j = " << (j-1) <<
" [" << S[j-1].size() <<
"," << U[j-1].size() <<
"]: ";)
122 unsigned int k = ret.
sift(g, h, j);
123 if (k < B.size() - j || !h.isIdentity()) {
132 BOOST_ASSERT(j < B.size());
133 S.push_back(std::list<typename PERM::ptr>());
134 U.push_back(TRANS(n));
136 boost::shared_ptr<PERM> hPtr(
new PERM(h));
137 S[j].insert(S[j].end(), hPtr);
140 if (j >= SchreierGens.size()) {
142 SchreierGens.push_back(localVar);
144 SchreierGens[j]->update(S[j].size() - 1);
156 this->mergeGenerators(S, ret);
void update(TRANS *U, PERMlistIt S_begin, PERMlistIt S_end)
updates transversal and group generators that the Schreier generators are constructed from
Definition schreier_generator.h:216
BSGS< PERM, TRANS > construct(ForwardIterator generatorsBegin, ForwardIterator generatorsEnd) const
constructs a BSGS for group given by generators with no base prescribed
Definition schreier_sims_construction.h:85
void orbitUpdate(unsigned int j, const PERMlist &generators, const typename PERM::ptr &g)
updates the j-th fundamental orbit with the given orbit generators and a new generator g
Definition bsgs.h:306
unsigned int sift(const PERM &g, PERM &siftee, unsigned int j=0) const
sifts an element through the specified transversal range
Definition bsgs.h:273