33 #ifndef TYPERECOGNITIONHEURISTIC_H_ 34 #define TYPERECOGNITIONHEURISTIC_H_ 39 #include <boost/iterator/counting_iterator.hpp> 40 #include <boost/pending/disjoint_sets.hpp> 73 bool addUnusedGenerator(
const PERM& p);
76 bool m_storeUnusedGenerators;
77 std::list<PERM> m_unusedGenerators;
79 std::vector<dom_int> m_rank;
80 std::vector<dom_int> m_parent;
81 boost::disjoint_sets<dom_int*,dom_int*> m_components;
91 : m_n(n), m_storeUnusedGenerators(storeUnusedGenerators), m_rank(n), m_parent(n), m_components(&m_rank[0], &m_parent[0])
93 for (dom_int i = 0; i < n; ++i)
94 m_components.make_set(i);
100 BOOST_ASSERT( p.size() == m_n );
103 unsigned int cycleIndex = 0;
105 for (
unsigned int i = 0; i < p.size(); ++i) {
108 return addUnusedGenerator(p);
110 cycle[cycleIndex++] = i;
118 BOOST_ASSERT(cycleIndex == 2);
120 m_components.union_set(cycle[0], cycle[1]);
125 template <
class PERM>
127 m_components.compress_sets(boost::counting_iterator<dom_int>(0), boost::counting_iterator<dom_int>(m_n));
129 std::vector<unsigned int> componentSizes(m_n);
130 for (
unsigned int i = 0; i < m_n; ++i) {
131 ++componentSizes[ m_components.find_set(i) ];
134 std::vector<int> nonTrivialComponentMap(m_n, -1);
135 unsigned int nonTrivialIndex = 0;
136 for (
unsigned int i = 0; i < m_n; ++i) {
137 if (componentSizes[i] > 1)
138 nonTrivialComponentMap[i] = nonTrivialIndex++;
142 orbits.resize(nonTrivialIndex);
144 for (
unsigned int i = 0; i < m_n; ++i) {
145 unsigned int componentIndex = m_components.find_set(i);
146 if (nonTrivialComponentMap[componentIndex] >= 0)
147 orbits[ nonTrivialComponentMap[componentIndex] ].push_back(i);
152 template <
class PERM>
154 m_unusedGenerators.push_back(p);
160 #endif // -- TYPERECOGNITIONHEURISTIC_H_ bool addGenerator(const PERM &p)
adds a group generator for recognition
Definition: type_recognition_heuristic.h:99
SymmetricGroupRecognitionHeuristic(unsigned int n, bool storeUnusedGenerators=false)
Definition: type_recognition_heuristic.h:90
const std::list< PERM > & unusedGenerators()
returns the list of all group generators that were not used for group recognition ...
Definition: type_recognition_heuristic.h:71
void symmetricGroupOrbits(std::vector< std::list< dom_int > > &orbits)
computes the orbits of recognized non-trivial symmetric subgroups
Definition: type_recognition_heuristic.h:126
Definition: abstract_bsgs.h:49
Fast recognition of symmetric group subgroups.
Definition: type_recognition_heuristic.h:50