Regina Calculation Engine
Public Member Functions | Static Public Member Functions | Protected Member Functions | Protected Attributes | List of all members
regina::NTreeSingleSoln< LPConstraint, BanConstraint, Integer > Class Template Reference

The main entry point for the tree traversal / branching algorithm to locate a single non-trivial normal surface satisfying given constraints within a 3-manifold triangulation. More...

#include <enumerate/ntreetraversal.h>

Inheritance diagram for regina::NTreeSingleSoln< LPConstraint, BanConstraint, Integer >:
regina::NTreeTraversal< LPConstraint, BanConstraint, Integer >

Public Member Functions

 NTreeSingleSoln (const NTriangulation *tri, NormalCoords coords)
 Creates a new object for running the tree traversal / branching algorithm to locate a non-trivial surface that satisfies the chosen constraints. More...
 
bool find ()
 Runs the tree traversal algorithm until it finds some non-trivial surface that satisfies the chosen constraints, or else proves that no such solution exists. More...
 
void cancel ()
 Cancels the current find() operation. More...
 
bool constraintsBroken () const
 Indicates whether or not the extra constraints from the template parameter LPConstraints were added successfully to the infrastructure for the search tree. More...
 
unsigned long nVisited () const
 Returns the total number of nodes in the search tree that we have visited thus far in the tree traversal. More...
 
void dumpTypes (std::ostream &out) const
 Writes the current type vector to the given output stream. More...
 
NNormalSurfacebuildSurface () const
 Reconstructs the full normal surface that is represented by the type vector at the current stage of the search. More...
 
NAngleStructurebuildStructure () const
 Reconstructs the full taut angle structure that is represented by the type vector at the current stage of the search. More...
 
bool verify (const NNormalSurface *s, const NMatrixInt *matchingEqns=0) const
 Ensures that the given normal or almost normal surface satisfies the matching equations, as well as any additional constraints from the template parameter LPConstraint. More...
 
bool verify (const NAngleStructure *s, const NMatrixInt *angleEqns=0) const
 Ensures that the given angle structure satisfies the angle equations, as well as any additional constraints from the template parameter LPConstraint. More...
 

Static Public Member Functions

static bool supported (NormalCoords coords)
 Indicates whether the given coordinate system is supported by this tree traversal infrastructure. More...
 

Protected Member Functions

void setNext (int nextType)
 Rearranges the search tree so that nextType becomes the next type that we process. More...
 
int nextUnmarkedTriangleType (int startFrom)
 Returns the next unmarked triangle type from a given starting point. More...
 
int feasibleBranches (int quadType)
 Determines how many different values we could assign to the given quadrilateral or angle type and still obtain a feasible system. More...
 
double percent () const
 Gives a rough estimate as to what percentage of the way the current type vector is through a full enumeration of the search tree. More...
 

Protected Attributes

const LPInitialTableaux< LPConstraint > origTableaux_
 The original starting tableaux that holds the adjusted matrix of matching equations, before the tree traversal algorithm begins. More...
 
const NormalCoords coords_
 The coordinate system in which we are enumerating or searching for normal surfaces, almost normal surfaces, or taut angle structures. More...
 
const int nTets_
 The number of tetrahedra in the underlying triangulation. More...
 
const int nTypes_
 The total length of a type vector. More...
 
const int nTableaux_
 The maximum number of tableaux that we need to keep in memory at any given time during the backtracking search. More...
 
char * type_
 The current working type vector. More...
 
int * typeOrder_
 A permutation of 0,...,nTypes_-1 that indicates in which order we select types: the first type we select (at the root of the tree) is type_[typeOrder_[0]], and the last type we select (at the leaves of the tree) is type_[typeOrder_[nTypes_-1]]. More...
 
int level_
 The current level in the search tree. More...
 
int octLevel_
 The level at which we are enforcing an octagon type (with a strictly positive number of octagons). More...
 
LPData< LPConstraint, Integer > * lp_
 Stores tableaux for linear programming at various nodes in the search tree. More...
 
LPData< LPConstraint, Integer > ** lpSlot_
 Recall from above that the array lp_ stores tableaux for the current node in the search tree and all of its ancestors. More...
 
LPData< LPConstraint, Integer > ** nextSlot_
 Points to the next available tableaux in lp_ that is free to use at each level of the search tree. More...
 
unsigned long nVisited_
 Counts the total number of nodes in the search tree that we have visited thus far. More...
 
LPData< LPConstraint, Integer > tmpLP_ [4]
 Temporary tableaux used by the function feasibleBranches() to determine which quadrilateral types or angle types have good potential for pruning the search tree. More...
 

Detailed Description

template<class LPConstraint = LPConstraintNone, typename BanConstraint = BanNone, typename Integer = NInteger>
class regina::NTreeSingleSoln< LPConstraint, BanConstraint, Integer >

The main entry point for the tree traversal / branching algorithm to locate a single non-trivial normal surface satisfying given constraints within a 3-manifold triangulation.

The constraints are passed using a combination of the template arguments LPConstraint and BanConstraint.

A common application of this algorithm is to find a surface of positive Euler characteristic, using the template argument LPConstraintEuler. This is useful for tasks such as 0-efficiency testing and prime decomposition (when this is done in standard normal coordinates), and also 3-sphere recognition (when this is done in standard almost normal coordinates). Indeed, the underlying algorithm is optimised for precisely this application.

By a "non-trivial" surface, we mean that at least one triangle coordinate is zero. Philosophically this is to avoid vertex linking surfaces, though if the triangulation has more than one vertex then this takes on a different meaning. See the warning on this matter below.

Be warned that this routine does not eliminate the zero vector, and so the template argument LPConstraint should include at least one constraint that eliminates the zero vector (e.g., positive Euler characteristic). Otherwise this algorithm may simply return the zero vector, and the information gained will not be very useful.

For any given normal coordinate, this routine will always try setting that coordinate to zero before it tries setting it to non-zero. In other words, if it does find a surface satisfying the given constraints, then it is guaranteed that the set of non-zero coordinate positions will be minimal (though not necessary a global minimum). In many settings (such as when using LPConstraintEuler), this guarantees that the final surface (if it exists) will be a vertex normal or almost normal surface.

The underlying algorithm is described in "A fast branching algorithm for unknot recognition with experimental polynomial-time behaviour", Burton and Ozlen, arXiv:1211.1079, and uses significant material from "A tree traversal algorithm for decision problems in knot theory and 3-manifold topology", Burton and Ozlen, Algorithmica 65:4 (2013), pp. 772-801.

To use this class, i.e., to locate a non-trivial normal or almost normal surface under the given constraints or to prove that no such surface exists, you can simply construct a NTreeSingleSoln object and call find(). You can then call buildSurface() to extract the details of the surface that was found.

If you wish to enumerate all vertex surfaces in a 3-manifold triangulation (instead of finding just one), you should use the class NTreeEnumeration instead.

This tree traversal can only enumerate surfaces in quadrilateral normal coordinates (NS_QUAD), standard normal coordinates (NS_STANDARD), quadrilateral-octagon almost normal coordinates (NS_AN_QUAD_OCT), or standard almost normal coordinates (NS_AN_STANDARD). For almost normal surfaces, we allow any number of octagons (including zero), but we only allow at most one octagon type in the entire triangulation. No coordinate systems other than these are supported.

The template argument Integer indicates the integer type that will be used throughout the underlying linear programming machinery. Unless you have a good reason to do otherwise, you should use the arbitrary-precision NInteger class (in which integers can grow arbitrarily large, and overflow can never occur).

Warning
Typically one should only use this class with one-vertex triangulations (since otherwise, setting at least one triangle coordinate to zero is not enough to rule out trivial vertex linking surfaces). Of course there may be settings in which multiple vertices make sense (for instance, in ideal triangulations with multiple cusps, or when using ban constraints), and in such settings this class will still work precisely as described.
If you examine the type vector (for instance, by calling dumpTypes()), be aware that this class merges the old types 0 and 1 together into a single branch of the search tree. This means that type 0 never appears, and that type 1 could indicate either positive quadrilaterals in the first position, or else no quadrilaterals at all.
Precondition
The parameters LPConstraint and BanConstraint must be subclasses of LPConstraintBase and BanConstraintBase respectively. See the LPConstraintBase and BanConstraintBase class notes for further details.
The default constructor for the template class Integer must intialise each new integer to zero. The classes NInteger and NNativeInteger, for instance, have this property.
Headers:
Parts of this template class are implemented in a separate header (ntreetraversal-impl.h), which is not included automatically by this file. Most end users should not need this extra header, since Regina's calculation engine already includes explicit instantiations for common combinations of template arguments.
Warning
The API for this class has not yet been finalised. This means that the class interface may change in new versions of Regina, without maintaining backward compatibility. If you use this class directly in your own code, please watch the detailed changelogs upon new releases to see if you need to make changes to your code.
Python:
Not present.

Constructor & Destructor Documentation

§ NTreeSingleSoln()

template<class LPConstraint , typename BanConstraint , typename Integer >
regina::NTreeSingleSoln< LPConstraint, BanConstraint, Integer >::NTreeSingleSoln ( const NTriangulation tri,
NormalCoords  coords 
)
inline

Creates a new object for running the tree traversal / branching algorithm to locate a non-trivial surface that satisfies the chosen constraints.

This constructor prepares the algorithm; in order to run the algorithm you should call find(), which returns true or false according to whether or not such a surface was found.

Precondition
The given triangulation is non-empty.
Both the trianglation and the given coordinate system adhere to any preconditions required by the template parameters LPConstraint and BanConstraint.
Parameters
trithe triangulation in which we wish to search for a non-trivial surface.
coordsthe normal or almost normal coordinate system in which to work. This must be one of NS_QUAD, NS_STANDARD, NS_AN_QUAD_OCT, or NS_AN_STANDARD.

Member Function Documentation

§ buildStructure()

template<class LPConstraint , typename BanConstraint , typename Integer >
NAngleStructure* regina::NTreeTraversal< LPConstraint, BanConstraint, Integer >::buildStructure ( ) const
inherited

Reconstructs the full taut angle structure that is represented by the type vector at the current stage of the search.

This routine is for use only with taut angle structures, not normal or almost normal surfaces.

The angle structure that is returned will be newly constructed, and it is the caller's responsibility to destroy it when it is no longer required.

There will always be a unique taut angle structure corresponding to this type vector (this follows from the preconditions below).

Precondition
This tree traversal is at a point in the search where it has found a feasible solution that represents a taut angle structure. This condition is always true after NTautEnumeration::next() returns true, or any time that NTautEnumeration::run() calls its callback function.
We are working with angle structure coordinates; that is, the coordinate system passed to the NTreeTraversal constructor was NS_ANGLE.
Returns
the taut angle structure that has been found at the current stage of the search.

§ buildSurface()

template<class LPConstraint , typename BanConstraint , typename Integer >
NNormalSurface* regina::NTreeTraversal< LPConstraint, BanConstraint, Integer >::buildSurface ( ) const
inherited

Reconstructs the full normal surface that is represented by the type vector at the current stage of the search.

This routine is for use only with normal (or almost normal) surfaces, not taut angle structures.

The surface that is returned will be newly constructed, and it is the caller's responsibility to destroy it when it is no longer required.

If the current type vector does not represent a vertex normal surface (which may be the case when calling NTreeSingleSoln::find()), then there may be many normal surfaces all represented by the same type vector; in this case there are no further guarantees about which of these normal surfaces you will get.

Precondition
This tree traversal is at a point in the search where it has found a feasible solution that represents a normal surface (though this need not be a vertex surface). This condition is always true after NTreeEnumeration::next() or NTreeSingleSoln::find() returns true, or any time that NTreeEnumeration::run() calls its callback function.
We are working with normal or almost normal surfaces. That is, the coordinate system passed to the NTreeTraversal constructor was not NS_ANGLE.
Returns
a normal surface that has been found at the current stage of the search.

§ cancel()

template<class LPConstraint , typename BanConstraint , typename Integer >
void regina::NTreeSingleSoln< LPConstraint, BanConstraint, Integer >::cancel ( )
inline

Cancels the current find() operation.

This may be called from another thread (it is thread-safe). If called, it signals that if find() is currently running then it should be cancelled at the earliest convenient opportunity.

§ constraintsBroken()

template<class LPConstraint , typename BanConstraint , typename Integer >
bool regina::NTreeTraversal< LPConstraint, BanConstraint, Integer >::constraintsBroken ( ) const
inlineinherited

Indicates whether or not the extra constraints from the template parameter LPConstraints were added successfully to the infrastructure for the search tree.

This query function is important because some constraints require additional preconditions on the underlying triangulation, and so these constraints cannot be added in some circumstances. If it is possible that the constraints might not be added successfully, this function should be tested as soon as the NTreeTraversal object has been created.

If the extra constraints were not added successfully, the search tree will be left in a consistent state but will give incorrect results (specifically, the extra constraints will be treated as zero functions).

Returns
true if the constraints were not added successfully, or false if the constraints were added successfully.

§ dumpTypes()

template<class LPConstraint , typename BanConstraint , typename Integer >
void regina::NTreeTraversal< LPConstraint, BanConstraint, Integer >::dumpTypes ( std::ostream &  out) const
inlineinherited

Writes the current type vector to the given output stream.

There will be no spaces between the types, and there will be no final newline.

Parameters
outthe output stream to which to write.

§ feasibleBranches()

template<class LPConstraint , typename BanConstraint , typename Integer >
int regina::NTreeTraversal< LPConstraint, BanConstraint, Integer >::feasibleBranches ( int  quadType)
protectedinherited

Determines how many different values we could assign to the given quadrilateral or angle type and still obtain a feasible system.

This will involve solving three or four linear programs, all based on the current state of the tableaux at the current level of the search tree. These assign 0, 1, 2 and 3 to the given quadrilateral or angle type in turn (here 0 is not used for angle types), and then enforce the corresponding constraints. For quadrilateral types, we count types 0 and 1 separately as in NTreeEnumeration, not merged together as in NTreeSingleSoln.

Precondition
The given quadrilateral or angle type has not yet been processed in the search tree (i.e., it has not had an explicit value selected).
When using angle structure coordinates, the final scaling coordinate has already been enforced as positive. (This is because, for angle structures, this routine does nothing to eliminate the zero solution.)
Parameters
quadTypethe quadrilateral or angle type to examine.
Returns
the number of type values 0, 1, 2 or 3 that yield a feasible system; this will be between 0 and 4 inclusive for quadrilateral types, or between 0 and 3 inclusive for angle types.

§ find()

template<class LPConstraint = LPConstraintNone, typename BanConstraint = BanNone, typename Integer = NInteger>
bool regina::NTreeSingleSoln< LPConstraint, BanConstraint, Integer >::find ( )

Runs the tree traversal algorithm until it finds some non-trivial surface that satisfies the chosen constraints, or else proves that no such solution exists.

Note that, if a solution is found, it will have a maximal (but not necessarily maximum) set of zero coordinates, which in some settings is enough to guarantee a vertex normal surface. See the NTreeSingleSoln class notes for details.

If find() does return true, you can extract details of the corresponding surface directly from this tree enumeration object: for instance, you can dump the type vector using dumpTypes(), or you can reconstruct the full surface using buildSurface(). Be warned that this class defines the type vector in an unusual way (see the NTreeSingleSoln class notes for details). If you call buildSurface(), remember to delete the surface once you are finished with it.

Precondition
The algorithm has not yet been run, i.e., you have not called find() before.
Returns
true if we found a non-trivial solution as described in the class notes, or false if no such solution exists.

§ nextUnmarkedTriangleType()

template<class LPConstraint , typename BanConstraint , typename Integer >
int regina::NTreeTraversal< LPConstraint, BanConstraint, Integer >::nextUnmarkedTriangleType ( int  startFrom)
inlineprotectedinherited

Returns the next unmarked triangle type from a given starting point.

Specifically, this routine returns the first unmarked triangle type whose type number is greater than or equal to startFrom. For more information on marking, see the BanConstraintBase class notes.

This routine simply searches through types by increasing index into the type vector; in particular, it does not make any use of the reordering defined by the typeOrder_ array.

Precondition
We are working in standard normal or almost normal coordinates. That is, the coordinate system passed to the NTreeTraversal constructor was one of NS_STANDARD or NS_AN_STANDARD.
The argument startFrom is at least nTets_ (i.e., it is at least as large as the index of the first triangle type).
Parameters
startFromthe index into the type vector of the triangle type from which we begin searching.
Returns
the index into the type vector of the next unmarked triangle type from startFrom onwards, or -1 if there are no more remaining.

§ nVisited()

template<class LPConstraint , typename BanConstraint , typename Integer >
unsigned long regina::NTreeTraversal< LPConstraint, BanConstraint, Integer >::nVisited ( ) const
inlineinherited

Returns the total number of nodes in the search tree that we have visited thus far in the tree traversal.

This figure might grow much faster than the number of solutions, since it also counts traversals through "dead ends" in the search tree.

This counts all nodes that we visit, including those that fail any or all of the domination, feasibility and zero tests. The precise way that this number is calculated is subject to change in future versions of Regina.

If you called an "all at once" routine such as NTreeEnumeration::run() or NTreeSingleSoln::find(), then this will be the total number of nodes that were visited in the entire tree traversal. If you are calling an "incremental" routine such as NTreeEnumeration::next() (i.e., you are generating one solution at time), then this will be the partial count of how many nodes have been visited so far.

Returns
the number of nodes visited so far.

§ percent()

template<class LPConstraint , typename BanConstraint , typename Integer >
double regina::NTreeTraversal< LPConstraint, BanConstraint, Integer >::percent ( ) const
protectedinherited

Gives a rough estimate as to what percentage of the way the current type vector is through a full enumeration of the search tree.

This is useful for progress tracking.

This routine only attemps to determine the percentage within a reasonable range of error (at the time of writing, 0.01%). This allows it to be more efficient (in particular, by only examining the branches closest to the root of the search tree).

Returns
the percentage, as a number between 0 and 100 inclusive.

§ setNext()

template<class LPConstraint , typename BanConstraint , typename Integer >
void regina::NTreeTraversal< LPConstraint, BanConstraint, Integer >::setNext ( int  nextType)
protectedinherited

Rearranges the search tree so that nextType becomes the next type that we process.

Specifically, this routine will set typeOrder_[level_ + 1] to nextType_, and will move other elements of typeOrder_ back by one position to make space as required.

Precondition
nextType is in the range 0,...,nTypes-1 inclusive.
nextType is still waiting to be processed; that is, nextType does not appear in the list typeOrder_[0,...,level_].
Parameters
nextTypethe next type to process.

§ supported()

template<class LPConstraint , typename BanConstraint , typename Integer >
bool regina::NTreeTraversal< LPConstraint, BanConstraint, Integer >::supported ( NormalCoords  coords)
inlinestaticinherited

Indicates whether the given coordinate system is supported by this tree traversal infrastructure.

Currently this is true only for NS_STANDARD and NS_QUAD (for normal surfaces), NS_AN_STANDARD and NS_AN_QUAD_OCT (for almost normal surfaces), and NS_ANGLE (for taut angle structures). Any additional restrictions imposed by LPConstraint and BanConstraint will also be taken into account.

Parameters
coordsthe coordinate system being queried.
Returns
true if and only if this coordinate system is supported.

§ verify() [1/2]

template<class LPConstraint , typename BanConstraint , typename Integer >
bool regina::NTreeTraversal< LPConstraint, BanConstraint, Integer >::verify ( const NNormalSurface s,
const NMatrixInt matchingEqns = 0 
) const
inherited

Ensures that the given normal or almost normal surface satisfies the matching equations, as well as any additional constraints from the template parameter LPConstraint.

This routine is for use only with normal (or almost normal) surfaces, not angle structures.

This routine is provided for diagnostic, debugging and verification purposes.

Instead of using the initial tableaux to verify the matching equations, this routine goes back to the original matching equations matrix as constructed by regina::makeMatchingEquations(). This ensures that the test is independent of any potential problems with the tableaux. You are not required to pass your own matching equations (if you don't, they will be temporarily reconstructed for you); however, you may pass your own if you wish to use a non-standard matching equation matrix, and/or reuse the same matrix to avoid the overhead of reconstructing it every time this routine is called.

Precondition
The normal or almost normal surface s uses the same coordinate system as was passed to the NTreeTraversal constructor. Moreover, this coordinate system is in fact a normal or almost normal coordinate system (i.e., not NS_ANGLE).
If matchingEqns is non-null, then the number of columns in matchingEqns is equal to the number of coordinates in the underlying normal or almost normal coordinate system.
Parameters
sthe normal surface to verify.
matchingEqnsthe matching equations to check against the given surface; this may be 0, in which case the matching equations will be temporarily reconstructed for you using regina::makeMatchingEquations().
Returns
true if the given surface passes all of the tests described above, or false if it fails one or more tests (indicating a problem or error).

§ verify() [2/2]

template<class LPConstraint , typename BanConstraint , typename Integer >
bool regina::NTreeTraversal< LPConstraint, BanConstraint, Integer >::verify ( const NAngleStructure s,
const NMatrixInt angleEqns = 0 
) const
inherited

Ensures that the given angle structure satisfies the angle equations, as well as any additional constraints from the template parameter LPConstraint.

This routine is for use only with angle structures, not normal (or almost normal) surfaces.

This routine is provided for diagnostic, debugging and verification purposes.

Instead of using the initial tableaux to verify the angle equations, this routine goes back to the original angle equations matrix as constructed by NAngleStructureVector::makeAngleEquations(). This ensures that the test is independent of any potential problems with the tableaux. You are not required to pass your own angle equations (if you don't, they will be temporarily reconstructed for you); however, you may pass your own if you wish to use a non-standard angle equation matrix, and/or reuse the same matrix to avoid the overhead of reconstructing it every time this routine is called.

Precondition
The coordinate system passed to the NTreeTraversal constructor was NS_ANGLE.
If angleEqns is non-null, then the number of columns in angleEqns is equal to the number of coordinates in the underlying angle structure coordinate system.
Parameters
sthe angle structure to verify.
angleEqnsthe angle equations to check against the given angle structure; this may be 0, in which case the angle equations will be temporarily reconstructed for you using NAngleStructureVector::makeMatchingEquations().
Returns
true if the given angle structure passes all of the tests described above, or false if it fails one or more tests (indicating a problem or error).

Member Data Documentation

§ coords_

template<class LPConstraint , typename BanConstraint , typename Integer >
const NormalCoords regina::NTreeTraversal< LPConstraint, BanConstraint, Integer >::coords_
protectedinherited

The coordinate system in which we are enumerating or searching for normal surfaces, almost normal surfaces, or taut angle structures.

This must be one of NS_QUAD or NS_STANDARD if we are only supporting normal surfaces, one of NS_AN_QUAD_OCT or NS_AN_STANDARD if we are allowing octagons in almost normal surfaces, or NS_ANGLE if we are searching for taut angle structures.

§ level_

template<class LPConstraint , typename BanConstraint , typename Integer >
int regina::NTreeTraversal< LPConstraint, BanConstraint, Integer >::level_
protectedinherited

The current level in the search tree.

As the search runs, this holds the index into typeOrder_ corresponding to the last type that we chose.

§ lp_

template<class LPConstraint , typename BanConstraint , typename Integer >
LPData<LPConstraint, Integer>* regina::NTreeTraversal< LPConstraint, BanConstraint, Integer >::lp_
protectedinherited

Stores tableaux for linear programming at various nodes in the search tree.

We only store a limited number of tableaux at any given time, and as the search progresses we overwrite old tableaux with new tableaux.

More precisely, we store a linear number of tableaux, essentially corresponding to the current node in the search tree and all of its ancestores, all the way up to the root node. In addition to these tableaux, we also store other immediate children of these ancestores that we have pre-prepared for future processing. See the documentation within routines such as NTreeEnumeration::next() for details of when and how these tableaux are constructed.

§ lpSlot_

template<class LPConstraint , typename BanConstraint , typename Integer >
LPData<LPConstraint, Integer>** regina::NTreeTraversal< LPConstraint, BanConstraint, Integer >::lpSlot_
protectedinherited

Recall from above that the array lp_ stores tableaux for the current node in the search tree and all of its ancestors.

This means we have one tableaux for the root node, as well as additional tableaux at each level 0,1,...,level_.

The array lpSlot_ indicates which element of the array lp_ holds each of these tableaux. Specifically: lpSlot_[0] points to the tableaux for the root node, and for each level i in the range 0,...,level_, the corresponding tableaux is *lpSlot_[i+1]. Again, see the documentation within routines such as NTreeEnumeration::next() for details of when and how these tableaux are constructed and later overwritten.

§ nextSlot_

template<class LPConstraint , typename BanConstraint , typename Integer >
LPData<LPConstraint, Integer>** regina::NTreeTraversal< LPConstraint, BanConstraint, Integer >::nextSlot_
protectedinherited

Points to the next available tableaux in lp_ that is free to use at each level of the search tree.

Specifically: nextSlot_[0] points to the next free tableaux at the root node, and for each level i in the range 0,...,level_, the corresponding next free tableaux is *nextSlot_[i+1].

The precise layout of the nextSlot_ array depends on the order in which we process quadrilateral, triangle and/or angle types.

§ nTableaux_

template<class LPConstraint , typename BanConstraint , typename Integer >
const int regina::NTreeTraversal< LPConstraint, BanConstraint, Integer >::nTableaux_
protectedinherited

The maximum number of tableaux that we need to keep in memory at any given time during the backtracking search.

§ nTets_

template<class LPConstraint , typename BanConstraint , typename Integer >
const int regina::NTreeTraversal< LPConstraint, BanConstraint, Integer >::nTets_
protectedinherited

The number of tetrahedra in the underlying triangulation.

§ nTypes_

template<class LPConstraint , typename BanConstraint , typename Integer >
const int regina::NTreeTraversal< LPConstraint, BanConstraint, Integer >::nTypes_
protectedinherited

The total length of a type vector.

§ nVisited_

template<class LPConstraint , typename BanConstraint , typename Integer >
unsigned long regina::NTreeTraversal< LPConstraint, BanConstraint, Integer >::nVisited_
protectedinherited

Counts the total number of nodes in the search tree that we have visited thus far.

This may grow much faster than the number of solutions, since it also counts traversals through "dead ends" in the search tree.

§ octLevel_

template<class LPConstraint , typename BanConstraint , typename Integer >
int regina::NTreeTraversal< LPConstraint, BanConstraint, Integer >::octLevel_
protectedinherited

The level at which we are enforcing an octagon type (with a strictly positive number of octagons).

If we are working with angle structures or normal surfaces only (and so we do not allow octagons at all), then octLevel_ = nTypes_. If we are allowing almost normal surfaces but we have not yet chosen an octagon type, then octLevel_ = -1.

§ origTableaux_

template<class LPConstraint , typename BanConstraint , typename Integer >
const LPInitialTableaux<LPConstraint> regina::NTreeTraversal< LPConstraint, BanConstraint, Integer >::origTableaux_
protectedinherited

The original starting tableaux that holds the adjusted matrix of matching equations, before the tree traversal algorithm begins.

§ tmpLP_

template<class LPConstraint , typename BanConstraint , typename Integer >
LPData<LPConstraint, Integer> regina::NTreeTraversal< LPConstraint, BanConstraint, Integer >::tmpLP_[4]
protectedinherited

Temporary tableaux used by the function feasibleBranches() to determine which quadrilateral types or angle types have good potential for pruning the search tree.

Other routines are welcome to use these temporary tableaux also (as "scratch space"); however, be aware that any call to feasibleBranches() will overwrite them.

§ type_

template<class LPConstraint , typename BanConstraint , typename Integer >
char* regina::NTreeTraversal< LPConstraint, BanConstraint, Integer >::type_
protectedinherited

The current working type vector.

As the search runs, we modify this type vector in-place. Any types beyond the current level in the search tree will always be set to zero.

§ typeOrder_

template<class LPConstraint , typename BanConstraint , typename Integer >
int* regina::NTreeTraversal< LPConstraint, BanConstraint, Integer >::typeOrder_
protectedinherited

A permutation of 0,...,nTypes_-1 that indicates in which order we select types: the first type we select (at the root of the tree) is type_[typeOrder_[0]], and the last type we select (at the leaves of the tree) is type_[typeOrder_[nTypes_-1]].

This permutation is allowed to change as the algorithm runs (though of course you can only change sections of the permutation that correspond to types not yet selected).


The documentation for this class was generated from the following file:

Copyright © 1999-2016, The Regina development team
This software is released under the GNU General Public License, with some additional permissions; see the source code for details.
For further information, or to submit a bug or other problem, please contact Ben Burton (bab@maths.uq.edu.au).