permlib  0.2.9
Library for permutation computations
Public Member Functions | List of all members
permlib::StrongGeneratingSetSorter< PERM > Class Template Reference

Class that can be used to sort a strong generating set. More...

#include <bsgs.h>

Inheritance diagram for permlib::StrongGeneratingSetSorter< PERM >:

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
 

Detailed Description

template<class PERM>
class permlib::StrongGeneratingSetSorter< PERM >

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.

Constructor & Destructor Documentation

◆ StrongGeneratingSetSorter()

template<class PERM >
template<class InputIterator >
permlib::StrongGeneratingSetSorter< PERM >::StrongGeneratingSetSorter ( InputIterator  baseBegin,
InputIterator  baseEnd 
)
inline
Parameters
baseBeginbegin-iterator(dom_int) to the base relative to which the strong generating set is to be sorted
baseEndend-iterator(dom_int) to the base relative to which the strong generating set is to be sorted

The documentation for this class was generated from the following file: