permlib
0.2.9
Library for permutation computations
|
data structure with elementary data types to represent a BSGS based on SchreierTreeTransversal More...
#include <bsgs_schreier_export.h>
Public Attributes | |
dom_int | n |
degree of the group | |
dom_int | baseSize |
size of the base | |
dom_int * | base |
base More... | |
dom_int | sgsSize |
size of the strong generating set | |
dom_int ** | sgs |
strong generating set More... | |
int ** | transversals |
transversals More... | |
data structure with elementary data types to represent a BSGS based on SchreierTreeTransversal
dom_int* permlib::exports::BSGSSchreierData::base |
base
array of size baseSize
dom_int** permlib::exports::BSGSSchreierData::sgs |
strong generating set
two-dim array of size sgsSize * n
int** permlib::exports::BSGSSchreierData::transversals |
transversals
two-dim array of size baseSize * n
Each transversal is stored as a tree in an array. The elements in the array point to a number, which is the (non-negative) index of the stored permutation in the list variable sgs. The array entry is -2 if no element is defined or -1 if element is identity (corresponds to base element position)