permlib
0.2.9
Library for permutation computations
|
insertion position after first non-trivial transversal More...
#include <redundant_base_point_insertion_strategy.h>
Public Member Functions | |
TrivialRedundantBasePointInsertionStrategy (const BSGS< PERM, TRANS > &bsgs) | |
constructor | |
virtual int | findInsertionPoint (dom_int beta, std::list< typename PERM::ptr > &S_i) const |
finds possible insertion point for base point More... | |
![]() | |
RedundantBasePointInsertionStrategy (const BSGS< PERM, TRANS > &bsgs) | |
constructor More... | |
Additional Inherited Members | |
![]() | |
const BSGS< PERM, TRANS > & | m_bsgs |
BSGS to work on. | |
insertion position after first non-trivial transversal
|
inlinevirtual |
finds possible insertion point for base point
beta | base point to be inserted |
S_i | generators for i-th fundamental orbit where i is the insert position found |
Implements permlib::RedundantBasePointInsertionStrategy< PERM, TRANS >.