permlib
0.2.6
Library for permutation computations
|
searching in a group with classical backtracking More...
#include <backtrack_search.h>
Public Types | |
typedef BaseSearch< BSGSIN, TRANSRET >::PERM | PERM |
typedef BaseSearch< BSGSIN, TRANSRET >::TRANS | TRANS |
Public Member Functions | |
BacktrackSearch (const BSGSIN &bsgs, unsigned int pruningLevelDCM, bool breakAfterChildRestriction=false, bool stopAfterFirstElement=false) | |
constructor | |
void | search (BSGS< PERM, TRANSRET > &groupK) |
searches for a subgroup and stores it into groupK | |
virtual BaseSearch< BSGSIN, TRANSRET >::PERM::ptr | searchCosetRepresentative (BSGS< PERM, TRANSRET > &groupK, BSGS< PERM, TRANSRET > &groupL) |
searches for a coset representative if one exists | |
Protected Member Functions | |
virtual const std::vector < dom_int > & | subgroupBase () const |
base of the sought subgroup | |
void | construct (SubgroupPredicate< PERM > *pred, bool addPredRefinement) |
initializes the search | |
unsigned int | search (const PERM &t, unsigned int level, unsigned int &completed, BSGS< PERM, TRANSRET > &groupK, BSGS< PERM, TRANSRET > &groupL) |
recursive backtrack search |
searching in a group with classical backtracking
permlib::classic::BacktrackSearch< BSGSIN, TRANSRET >::BacktrackSearch | ( | const BSGSIN & | bsgs, |
unsigned int | pruningLevelDCM, | ||
bool | breakAfterChildRestriction = false , |
||
bool | stopAfterFirstElement = false |
||
) |
constructor
bsgs | BSGS to search in |
pruningLevelDCM | prune levels smaller than pruningLevelDCM by double coset minimality with base change |
breakAfterChildRestriction | true iff the rest of a search level can be skipped when one element has been skipped due to child restriction |
stopAfterFirstElement | true iff the search can be stopped after the first element found with the desired property |
BaseSearch< BSGSIN, TRANSRET >::PERM::ptr permlib::classic::BacktrackSearch< BSGSIN, TRANSRET >::searchCosetRepresentative | ( | BSGS< PERM, TRANSRET > & | groupK, |
BSGS< PERM, TRANSRET > & | groupL | ||
) | [virtual] |
searches for a coset representative if one exists
the two arguments are two groups K and L such that
groupK | subgroup of G |
groupL | subgroup of G |
Implements permlib::BaseSearch< BSGSIN, TRANSRET >.