|
using | ToothList = std::vector< SimpleTooth::Ptr > |
|
using | IteratorMat = util::SquareUT< ToothList::reverse_iterator > |
|
|
static std::pair< int, int > | get_range (ToothBody s, const std::vector< int > &perm, const std::vector< Graph::AdjObj > &root_nbrs) |
| Get the range of adjacency zones for a tooth body wrt a given root. More...
|
|
static bool | root_equivalent (int root, ToothBody s1, ToothBody s2, const std::vector< int > &tour, const std::vector< int > &perm, const std::vector< Graph::Node > &nodelist) |
|
static void | print_tooth (const SimpleTooth &T, bool full, const std::vector< int > &tour_nodes) |
|
|
std::vector< ToothList > | light_teeth |
|
std::vector< std::array< int, 3 > > | list_sizes |
|
|
static void | add_tooth (ToothList &teeth, std::vector< IteratorMat > &ranges, std::array< int, 3 > &sizes, int root, int body_start, int body_end, double slack, const std::vector< int > &tour, const std::vector< int > &perm, const std::vector< Graph::Node > &nodelist) |
|
static int | teeth_cb (double cut_val, int cut_start, int cut_end, void *u_data) |
|
IntPair CMR::Sep::CandidateTeeth::get_range |
( |
ToothBody |
s, |
|
|
const std::vector< int > & |
perm, |
|
|
const std::vector< Graph::AdjObj > & |
root_nbrs |
|
) |
| |
|
static |
Get the range of adjacency zones for a tooth body wrt a given root.
- Parameters
-
root | the root of the tooth being considered. |
s | the body of the tooth being considered. |
root_nbrs | if nodelist is the Node vector for a support graph in AdjList format, and tour is the resident tour, this should be the vector nodelist[tour[root]].neighbors . |
- Returns
- an IntPair indicating the adjacency zone range of
s
.
The documentation for this class was generated from the following files: