Main Page   Class Hierarchy   Compound List   File List   Compound Members   File Members  

GraphConjugacyProblem Class Reference

#include <GraphConjugacyProblem.h>

List of all members.

Public Methods

 GraphConjugacyProblem (const FPGroup &, const Word &u, const Word &v)
 ~GraphConjugacyProblem ()
void startComputation ()
void continueComputation (const SubgroupGraph &theGraph)
void continueComputation ()
bool done () const
bool theNewGraphIsNeeded () const
Word getConjugator ()

Private Methods

 GraphConjugacyProblem (const GraphConjugacyProblem &)
GraphConjugacyProblem& operator= (const GraphConjugacyProblem &)
void finishComputation ()
bool findConjugator (const DCGState &state1, DCGLabelType label1, const DCGState &state2, DCGLabelType label2, int length, Word &conjugator)
bool theConjugatorIsFound (const DCGState &state1, const DCGState &state2) const
void mark (int *, const DCGState &, int *, const DCGState &, int)
void clear (int *, const DCGState &, int *, const DCGState &)
void getMarks (const int *, const DCGState &, const int *, const DCGState &, int &, int &) const
bool weHaveTheSameCycles (int *, const DCGState &, int *, const DCGState &) const
void finishInterruption ()

Private Attributes

int numberOfGenerators
int maxGeneratorLength
Word theConjugator
const FPGroup theGroup
Word UConjugator
Word VConjugator
Word U
Word V
bool bStart
bool bDone
bool isInterrupted
int saveWayIndex
int saveLabel
DCGState saveLeftState
DCGState saveRightState
int* leftMarks
int* rightMarks

Static Private Attributes

const int timerValue = 1000

Constructor & Destructor Documentation

GraphConjugacyProblem::GraphConjugacyProblem ( const FPGroup &,
const Word & u,
const Word & v )

GraphConjugacyProblem::~GraphConjugacyProblem ( ) [inline]

Definition at line 79 of file GraphConjugacyProblem.h.

GraphConjugacyProblem::GraphConjugacyProblem ( const GraphConjugacyProblem & ) [private]

Member Function Documentation

void GraphConjugacyProblem::startComputation ( ) [inline]

Definition at line 91 of file GraphConjugacyProblem.h.

void GraphConjugacyProblem::continueComputation ( const SubgroupGraph & theGraph )

void GraphConjugacyProblem::continueComputation ( )

bool GraphConjugacyProblem::done ( ) const [inline]

Definition at line 127 of file GraphConjugacyProblem.h.

Referenced by ~GraphConjugacyProblem().

bool GraphConjugacyProblem::theNewGraphIsNeeded ( ) const [inline]

Definition at line 131 of file GraphConjugacyProblem.h.

Word GraphConjugacyProblem::getConjugator ( ) [inline]

Definition at line 144 of file GraphConjugacyProblem.h.

GraphConjugacyProblem& GraphConjugacyProblem::operator= ( const GraphConjugacyProblem & ) [private]

void GraphConjugacyProblem::finishComputation ( ) [inline, private]

Definition at line 207 of file GraphConjugacyProblem.h.

Referenced by ~GraphConjugacyProblem().

bool GraphConjugacyProblem::findConjugator ( const DCGState & state1,
DCGLabelType label1,
const DCGState & state2,
DCGLabelType label2,
int length,
Word & conjugator ) [private]

bool GraphConjugacyProblem::theConjugatorIsFound ( const DCGState & state1,
const DCGState & state2 ) const [private]

void GraphConjugacyProblem::mark ( int *,
const DCGState &,
int *,
const DCGState &,
int ) [private]

void GraphConjugacyProblem::clear ( int *,
const DCGState &,
int *,
const DCGState & ) [private]

void GraphConjugacyProblem::getMarks ( const int *,
const DCGState &,
const int *,
const DCGState &,
int &,
int & ) const [private]

bool GraphConjugacyProblem::weHaveTheSameCycles ( int *,
const DCGState &,
int *,
const DCGState & ) const [private]

void GraphConjugacyProblem::finishInterruption ( ) [private]

Referenced by finishComputation().

Member Data Documentation

int GraphConjugacyProblem::numberOfGenerators [private]

Definition at line 165 of file GraphConjugacyProblem.h.

int GraphConjugacyProblem::maxGeneratorLength [private]

Definition at line 166 of file GraphConjugacyProblem.h.

Word GraphConjugacyProblem::theConjugator [private]

Definition at line 167 of file GraphConjugacyProblem.h.

const FPGroup GraphConjugacyProblem::theGroup [private]

Definition at line 168 of file GraphConjugacyProblem.h.

Word GraphConjugacyProblem::UConjugator [private]

Definition at line 169 of file GraphConjugacyProblem.h.

Word GraphConjugacyProblem::VConjugator [private]

Definition at line 170 of file GraphConjugacyProblem.h.

Word GraphConjugacyProblem::U [private]

Definition at line 172 of file GraphConjugacyProblem.h.

Word GraphConjugacyProblem::V [private]

Definition at line 173 of file GraphConjugacyProblem.h.

bool GraphConjugacyProblem::bStart [private]

Definition at line 174 of file GraphConjugacyProblem.h.

bool GraphConjugacyProblem::bDone [private]

Definition at line 175 of file GraphConjugacyProblem.h.

DoubleCosetGraph* GraphConjugacyProblem::DCG [private]

Definition at line 177 of file GraphConjugacyProblem.h.

DCGVertexIterator* GraphConjugacyProblem::I [private]

Definition at line 178 of file GraphConjugacyProblem.h.

Timer* GraphConjugacyProblem::timer [private]

Definition at line 179 of file GraphConjugacyProblem.h.

const int GraphConjugacyProblem::timerValue = 1000 [static, private]

Definition at line 180 of file GraphConjugacyProblem.h.

bool GraphConjugacyProblem::isInterrupted [private]

Definition at line 185 of file GraphConjugacyProblem.h.

DoubleWayElt* GraphConjugacyProblem::way [private]

Definition at line 186 of file GraphConjugacyProblem.h.

int GraphConjugacyProblem::saveWayIndex [private]

Definition at line 187 of file GraphConjugacyProblem.h.

int GraphConjugacyProblem::saveLabel [private]

Definition at line 188 of file GraphConjugacyProblem.h.

DCGState GraphConjugacyProblem::saveLeftState [private]

Definition at line 189 of file GraphConjugacyProblem.h.

DCGState GraphConjugacyProblem::saveRightState [private]

Definition at line 190 of file GraphConjugacyProblem.h.

int* GraphConjugacyProblem::leftMarks [private]

Definition at line 191 of file GraphConjugacyProblem.h.

int* GraphConjugacyProblem::rightMarks [private]

Definition at line 192 of file GraphConjugacyProblem.h.

The documentation for this class was generated from the following file:
Generated at Tue Jun 19 09:49:55 2001 for Magnus Classes by doxygen1.2.6 written by Dimitri van Heesch, © 1997-2001