36 #include <permlib/predicate/pointwise_stabilizer_predicate.h> 45 template<
class PERM,
class TRANS>
66 template<
class PERM,
class TRANS>
68 bool redundant =
true;
70 BOOST_FOREACH(
const typename PERM::ptr& g, bsgs.
S) {
73 if (*g / alpha != alpha) {
79 #ifdef PERMLIB_DEBUG_OUTPUT 81 std::cout <<
"skip redundant " << (alpha+1) << std::endl;
82 print_iterable(bsgs.
B.begin(), bsgs.
B.begin() + baseTargetPos, 1,
" redundant for");
84 std::cout <<
"look for " << (alpha+1) <<
" at position " << baseTargetPos << std::endl;
93 #endif // -- BASECHANGE_H_ abstract base class for base change algorithms
Definition: base_change.h:46
BaseChange()
constructor
Definition: base_change.h:49
bool isRedundant(const BSGSCore< PERM, TRANS > &bsgs, unsigned int baseTargetPos, unsigned long alpha) const
checks if insertion of a base point at given position is redundant
Definition: base_change.h:67
core data of a base and strong generating set (BSGS)
Definition: bsgs_core.h:42
predicate matching a permutation if it stabilizes a given list of points pointwise ...
Definition: pointwise_stabilizer_predicate.h:42
std::vector< dom_int > B
base
Definition: bsgs_core.h:55
unsigned int m_statScheierGeneratorsConsidered
nuber of Schreier generators considered in transposition since construction
Definition: base_change.h:55
PERMlist S
strong generating set
Definition: bsgs_core.h:57
Definition: abstract_bsgs.h:49
unsigned int m_statTranspositions
nuber of base transpositions needed since construction
Definition: base_change.h:52