A pivot selection strategy for the Euler algorithm.
More...
#include <PivotStrategy.h>
A pivot selection strategy for the Euler algorithm.
Definition at line 28 of file PivotStrategy.h.
virtual PivotStrategy::~PivotStrategy |
( |
| ) |
|
|
inlinevirtual |
PivotStrategy::PivotStrategy |
( |
| ) |
|
|
inlineprotected |
virtual void PivotStrategy::computationCompleted |
( |
const PivotEulerAlg & |
alg | ) |
|
|
pure virtual |
Call this function once when computation is complete.
Split state.
Returns null if state was a base case. Otherwise state and the return value become the two substates. divCounts[var] must be the number of generators that div divides.
virtual void PivotStrategy::getName |
( |
ostream & |
out | ) |
const |
|
pure virtual |
Prints the name of the strategy to out.
virtual bool PivotStrategy::shouldTranspose |
( |
const EulerState & |
state | ) |
const |
|
pure virtual |
Returns true if transposing state is adviced.
The documentation for this class was generated from the following file: