permlib 0.2.9
Library for permutation computations
Loading...
Searching...
No Matches
Class Hierarchy
This inheritance list is sorted roughly, but not completely, alphabetically:
[detail level 1234]
 Cpermlib::AbstractPermutationGroupA high level interface for a permutation group
 Cpermlib::BaseChange< PERM, TRANS >Abstract base class for base change algorithms
 Cpermlib::BaseChange< PERM, typename BSGSIN::TRANStype >
 Cpermlib::BaseConstruction< PERM, TRANS >Base class for BSGS construction algorithms
 Cpermlib::BaseConstruction< TRANS::PERMtype, TRANS >
 Cpermlib::BaseSearch< BSGSIN, TRANSRET >Base class for searching in a group
 Cpermlib::BaseTranspose< PERM, TRANS >Abstract base class for base transposition
 Cstd::binary_function
 Cpermlib::BlockVectorAction< PERM >
 Cpermlib::BSGSCore< PERM, TRANS >Core data of a base and strong generating set (BSGS)
 Cpermlib::BSGSCore< PERM, SymmetricGroupTransversal< PERM > >
 Cpermlib::exports::BSGSSchreierBaseBase class for import/export of a BSGS based on SchreierTreeTransversal
 Cpermlib::exports::BSGSSchreierDataData structure with elementary data types to represent a BSGS based on SchreierTreeTransversal
 Cpermlib::delete_objectCallable object to delete a pointer
 Cpermlib::DSetAction< PERM >Action of a permutation on a dynamic bitset
 Cpermlib::Generator< PERM >Interface for group element generators
 Cpermlib::Generator< TRANS::PERMtype >
 Cpermlib::GiantTestBase
 Cpermlib::GroupTypeAbstract base class for permutation group types
 Cpermlib::Orbit< PERM, PDOMAIN >Abstract base class for orbit computation
 Cpermlib::Orbit< PERM, unsigned long >
 Cpermlib::OrbitLexMinSearch< BSGSIN >Algorithm to find the lexicographically minimal set in an orbit
 Cpermlib::partition::PartitionPartition
 Cpermlib::PermutationPermutation class storing all values explicitly
 Cpermlib::PermutationWordPermutation class storing permutations as words of elementary Permutation 's
 Cpermlib::PrimeHelperHelper class for primality checks
 Cpermlib::PrimitivitySGSTest< TRANS >Tests a transitive group for which a strong generating set is availble for primitivity
 Cpermlib::PrimitivityTest< PERM >Tests a transitive group is availble for primitivity
 Cpermlib::RedundantBasePointInsertionStrategy< PERM, TRANS >Strategy for redundant base point insertion
 Cpermlib::partition::Refinement< PERM >Base class for a $\mathcal P$-refinement which is used in an R-base and bound to an initial partition
 Cpermlib::partition::RefinementFamily< PERM >Class of $\mathcal P$-refinements for a given problem
 Cpermlib::RefinementFamily< PERM >
 Cpermlib::helpers::SupportRestrictionHelper class to decide when an permutation action on a set is trivial or can be reduced to a subset
 Cpermlib::SymmetricGroupRecognitionHeuristic< PERM >Fast recognition of symmetric group subgroups
 Cpermlib::SymmetricGroupTransversal< PERM >Transversal of a symmetric group
 Cpermlib::Transversal< PERM >::TrivialActionAction of a PERM on unsigned long element
 Cpermlib::TypeRecognition< PERM, TRANSVERSAL >Class for a basic type recognition of permutation groups
 Cstd::unary_function