permlib
0.2.9
Library for permutation computations
|
Class that can be used to sort a strong generating set. More...
#include <bsgs.h>
Public Member Functions | |
template<class InputIterator > | |
StrongGeneratingSetSorter (InputIterator baseBegin, InputIterator baseEnd) | |
bool | operator() (const typename PERM::ptr &p1, const typename PERM::ptr &p2) const |
true iff p1 stabilizes more base points (in increasing order) than p2 | |
Class that can be used to sort a strong generating set.
The goal is to sort a list of strong generators so that generators for the stabilizers in the stabilizer chain are next to each other.
|
inline |
baseBegin | begin-iterator(dom_int) to the base relative to which the strong generating set is to be sorted |
baseEnd | end-iterator(dom_int) to the base relative to which the strong generating set is to be sorted |