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

A base class for searches that employ the tree traversal algorithm for enumerating and locating vertex normal surfaces and taut angle structures. More...

#include <enumerate/ntreetraversal.h>

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

Public Member Functions

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

 NTreeTraversal (const NTriangulation *tri, NormalCoords coords, int branchesPerQuad, int branchesPerTri, bool enumeration)
 Initialises a new base object for running the tree traversal algorithm. More...
 
 ~NTreeTraversal ()
 Destroys this object. More...
 
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, typename BanConstraint, typename Integer>
class regina::NTreeTraversal< LPConstraint, BanConstraint, Integer >

A base class for searches that employ the tree traversal algorithm for enumerating and locating vertex normal surfaces and taut angle structures.

Users should not use this base class directly; instead use one of the subclasses NTreeEnumeration (for enumerating all vertex normal surfaces), NTautEnumeration (for enumerating all taut angle structures), or NTreeSingleSoln (for locating a single non-trivial solution under additional constraints, such as positive Euler characteristic).

For normal surfaces, the full algorithms are described respectively in "A tree traversal algorithm for decision problems in knot theory and 3-manifold topology", Burton and Ozlen, Algorithmica 65:4 (2013), pp. 772-801, and "A fast branching algorithm for unknot recognition with experimental polynomial-time behaviour", Burton and Ozlen, arXiv:1211.1079.

This base class provides the infrastructure for the search tree, and the subclasses handle the mechanics of the moving through the tree according to the backtracking search. The domination test is handled separately by the class NTypeTrie, and the feasibility test is handled separately by the class LPData.

This class holds the particular state of the tree traversal at any point in time, as described by the current level (indicating our current depth in the search tree) and type vector (indicating which branches of the search tree we have followed). For details on these concepts, see the Algorithmica paper cited above. The key details are summarised below; throughout this discussion n represents the number of tetrahedra in the underlying triangulation.

In the original Algorithmica paper, we choose types in the order type_[0], type_[1] and so on, working from the root of the tree down to the leaves. Here we support a more flexible system: there is an internal permutation typeOrder_, and we choose types in the order type_[typeOrder_[0]], type_[typeOrder_[1]] and so on. This permutation may mix quadrilateral and triangle processing, and may even change as the algorithm runs.

This class can also support octagon types in almost normal surfaces. However, we still do our linear programming in standard or quadrilateral coordinates, where we represent an octagon using two conflicting quadrilaterals in the same tetrahedron (which meet the tetrahedron boundary in the same set of arcs as a single octagon would). As with the almost normal coordinate systems in NNormalSurfaceList, we allow multiple octagons of the same type, but only one octagon type in the entire tetrahedron. In the type vector, octagons are indicated by setting a quadrilateral type to 4, 5 or 6.

There is optional support for adding extra linear constraints (such as a constraint on Euler characteristic), supplied by the template parameter LPConstraint. If there are no additional constraints, simply use the template parameter LPConstraintNone.

Also, there is optional support for banning coordinates (i.e., insisting that certain coordinates must be set to zero), and/or marking coordinates (for normal and almost normal surfaces this affects what is meant by a "non-trivial" surface for the NTreeSingleSoln algorithm; the concept of marking may be expanded further in future versions of Regina). These options are supplied by the template parameter BanConstraint. If there are no coordinates to ban or mark, simply use the template parameter BanNone.

In some cases, it is impossible to add the extra linear constraints that we would like (for instance, if they require additional preconditions on the underlying triangulation). If this is a possibility in your setting, you should call constraintsBroken() to test for this once the NTreeTraversal object has been constructed.

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).

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

§ NTreeTraversal()

template<class LPConstraint , typename BanConstraint , typename Integer >
regina::NTreeTraversal< LPConstraint, BanConstraint, Integer >::NTreeTraversal ( const NTriangulation tri,
NormalCoords  coords,
int  branchesPerQuad,
int  branchesPerTri,
bool  enumeration 
)
protected

Initialises a new base object for running the tree traversal algorithm.

This routine may only be called by subclass constructors; for more information on how to create and run a tree traversal, see subclasses such as NTreeEnumeration, NTautEnumeration or NTreeSingleSoln instead.

Precondition
The given triangulation is non-empty.
Parameters
trithe triangulation in which we wish to search for normal surfaces or taut angle structures.
coordsthe coordinate system in which wish to search for normal surfaces or taut angle structures. This must be one of NS_QUAD, NS_STANDARD, NS_AN_QUAD_OCT, NS_AN_STANDARD, or NS_ANGLE.
branchesPerQuadthe maximum number of branches we spawn in the search tree for each quadrilateral or angle type (e.g., 4 for a vanilla normal surface tree traversal algorithm, or 3 for enumerating taut angle structures).
branchesPerTrithe maximum number of branches we spawn in the search tree for each triangle type (e.g., 2 for a vanilla normal surface tree traversal algorithm). If the underlying coordinate system does not support triangles then this argument will be ignored.
enumerationtrue if we should optimise the tableaux for a full enumeration of vertex surfaces or taut angle structures, or false if we should optimise the tableaux for an existence test (such as searching for a non-trivial normal disc or sphere).

§ ~NTreeTraversal()

template<class LPConstraint , typename BanConstraint , typename Integer >
regina::NTreeTraversal< LPConstraint, BanConstraint, Integer >::~NTreeTraversal ( )
protected

Destroys this object.

Member Function Documentation

§ buildStructure()

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

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

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.

§ constraintsBroken()

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

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
inline

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)
protected

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.

§ nextUnmarkedTriangleType()

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

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
inline

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
protected

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)
protected

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)
inlinestatic

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

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

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_
protected

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_
protected

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_
protected

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_
protected

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_
protected

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_
protected

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_
protected

The number of tetrahedra in the underlying triangulation.

§ nTypes_

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

The total length of a type vector.

§ nVisited_

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

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_
protected

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_
protected

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]
protected

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_
protected

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_
protected

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).