1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
|
// Copyright (C) 1994 The New York Group Theory Cooperative
// See magnus/doc/COPYRIGHT for the full notice.
// Contents: Definition of the DoubleCosetGraph class.
//
// Principal Author: Dmitry Bormotov
//
// Status: in progress
//
// Revision History:
//
// Special Notes:
//
// Next implementation steps:
//
#ifndef _DOUBLE_COSET_GRAPH_H_
#define _DOUBLE_COSET_GRAPH_H_
#include "SubgroupGraph.h"
typedef SubgroupGraphRep::LabelType DCGLabelType;
typedef SubgroupGraphRep::VertexType DCGVertexType;
enum DCGPlace { inH, inU, inK };
struct DCGState {
DCGState( DCGPlace place = inH ,
DCGVertexType vertex = SubgroupGraphRep::baseVertex )
: currentPlace( place ), currentVertex( vertex ) { }
DCGState( DCGPlace place, int uCurrent ) :
currentPlace( place ), UCurrent( uCurrent ) { }
DCGState& operator = ( const DCGState& state )
{
if( (currentPlace = state.currentPlace) == inU )
UCurrent = state.UCurrent;
else
currentVertex = state.currentVertex;
}
bool operator == ( const DCGState& state ) const
{
if( currentPlace != state.currentPlace )
return false;
if( currentPlace == inU ) {
if( UCurrent != state.UCurrent )
return false;
}
else
if( currentVertex != state.currentVertex )
return false;
return true;
}
bool operator != ( const DCGState& state ) const
{
return !(*this == state);
}
friend ostream& operator << ( ostream& ostr, const DCGState& state )
{
ostr << "(" << state.currentPlace << ",";
if( state.currentPlace == inU )
ostr << state.UCurrent;
else
ostr << state.currentVertex;
ostr << ")";
return ostr;
}
void assign( DCGPlace place, DCGVertexType vertex)
{
currentPlace = place;
currentVertex = vertex;
}
void assign( DCGPlace place, int uCurrent )
{
currentPlace = place;
UCurrent = uCurrent;
}
DCGPlace currentPlace;
union {
DCGVertexType currentVertex;
int UCurrent;
};
};
// ------------------------ GraphConjugacyProblem ---------------------------//
class DoubleCosetGraph
{
public:
/////////////////////////////////////////////////////////////////////////
// //
// Constructors: //
// //
/////////////////////////////////////////////////////////////////////////
DoubleCosetGraph( const SubgroupGraph& h, const Word& u,
const SubgroupGraph& k, int hWidth, int kWidth);
~DoubleCosetGraph();
/////////////////////////////////////////////////////////////////////////
// //
// Accessors: //
// //
/////////////////////////////////////////////////////////////////////////
bool contains( const Word& ) const;
bool canGo( const DCGState& originState, DCGState& newState,
DCGLabelType label ) const;
bool canBack( const DCGState& originState, DCGState& newState,
DCGLabelType label ) const;
bool canAdvancedGo( const DCGState& originState,
DCGState& newState, DCGLabelType label ) const;
bool canAdvancedBack( const DCGState& originState,
DCGState& newState, DCGLabelType label ) const;
bool goThroughWord( const Word& W, const DCGState& originState,
DCGState& finishState, int& WCurrent ) const;
bool findWord( const Word& W, const DCGState& originState,
DCGState& finishState ) const;
/////////////////////////////////////////////////////////////////////////
// //
// Data Members: //
// //
/////////////////////////////////////////////////////////////////////////
static const DCGVertexType emptyTarget = SubgroupGraphRep::emptyTarget;
static const DCGVertexType baseVertex = SubgroupGraphRep::baseVertex;
const SubgroupGraph H;
const SubgroupGraph K;
const Word U;
private:
DCGVertexType **subgroupArrows;
DCGVertexType *wordArrows;
DCGVertexType **backSubgroupArrows;
DCGVertexType *backWordArrows;
int HWidth;
int KWidth;
DCGVertexType enumOriginVertex;
int enumWordLength;
//////////////////////////////////////////////////////////////
// //
// Private functions: //
// //
//////////////////////////////////////////////////////////////
DoubleCosetGraph( const DoubleCosetGraph& );
DoubleCosetGraph& operator = ( const DoubleCosetGraph& );
void joinPieces( DCGVertexType HVertex, DCGVertexType KVertex );
/////////////////////////////////////////////////////////////////////////
// //
// Debugging stuff: //
// //
/////////////////////////////////////////////////////////////////////////
public:
void debugPrint( );
#ifdef DEBUG
friend int main(int, char**);
#endif
};
inline bool DoubleCosetGraph::findWord( const Word& W,
const DCGState& originState, DCGState& finishState ) const
{
int WCurrent;
if( goThroughWord(W, originState, finishState, WCurrent) )
return true;
else
return false;
}
//--------------------------- DCGVertexIterator -----------------------------//
class DCGVertexIterator
{
public:
/////////////////////////////////////////////////////////////////////////
// //
// Constructors: //
// //
/////////////////////////////////////////////////////////////////////////
DCGVertexIterator( const DoubleCosetGraph& dcg ) : DCG( dcg ) { reset( ); }
// No default constructor
// Copy constructor provided by compiler (does logical deep copy).
/////////////////////////////////////////////////////////////////////////
// //
// Status Queries: //
// //
/////////////////////////////////////////////////////////////////////////
bool done( ) { return bDone; }
/////////////////////////////////////////////////////////////////////////
// //
// Accessors: //
// //
/////////////////////////////////////////////////////////////////////////
void reset( );
DCGState value( )
{
#if SAFETY > 0
if( bDone )
error("DCGState DCGVertexIterator<K>::value( ) : "
"Tried to retrieve value from iterator which is done.");
#endif
return state;
}
bool next( );
private:
/////////////////////////////////////////////////////////////////////////
// //
// Data Members: //
// //
/////////////////////////////////////////////////////////////////////////
const DoubleCosetGraph& DCG;
DCGState state;
bool bDone;
/////////////////////////////////////////////////////////////////////////
// //
// Private functions: //
// //
/////////////////////////////////////////////////////////////////////////
};
#endif
|
