|
permlib
0.2.8
Library for permutation computations
|
predicate for the subgroup that stabilizes a given point set More...
#include <setwise_stabilizer_predicate.h>
Public Member Functions | |
| template<class InputIterator > | |
| SetwiseStabilizerPredicate (InputIterator begin, InputIterator end) | |
| constructor | |
| virtual bool | operator() (const PERM &p) const |
| true iff group element fulfills predicate | |
| virtual bool | childRestriction (const PERM &h, unsigned int i, unsigned long beta_i) const |
| checks if a given group element should not be followed in backtrack search | |
| virtual unsigned int | limit () const |
| limit of recursion depth in backtrack search | |
predicate for the subgroup that stabilizes a given point set
| permlib::SetwiseStabilizerPredicate< PERM >::SetwiseStabilizerPredicate | ( | InputIterator | begin, |
| InputIterator | end | ||
| ) |
constructor
| begin | begin iterator for list of points (unsigned long) to be stabilized |
| end | end iterator for list of points (unsigned long) to be stabilized |
| bool permlib::SetwiseStabilizerPredicate< PERM >::childRestriction | ( | const PERM & | h, |
| unsigned int | i, | ||
| unsigned long | beta_i | ||
| ) | const [virtual] |
checks if a given group element should not be followed in backtrack search
If returns false then element h that arises at backtrack level i with corresponding base element beta_i will not extend to a "complete" group element that fulfills the predicate
| h | (partial) group element, arising in the backtrack search |
| i | backtrack recursion level |
| beta_i | base element corresponding to current backtrack recursion level |
Implements permlib::SubgroupPredicate< PERM >.
| unsigned int permlib::SetwiseStabilizerPredicate< PERM >::limit | ( | ) | const [virtual] |
limit of recursion depth in backtrack search
only images of the #{limit()} first base points have to be considered
Implements permlib::SubgroupPredicate< PERM >.
1.7.6.1