Google OR-Tools v9.15
a fast and portable software suite for combinatorial optimization
Loading...
Searching...
No Matches
one_tree_lower_bound.h File Reference
#include <cmath>
#include <cstdint>
#include <limits>
#include <set>
#include <utility>
#include <vector>
#include "absl/log/log.h"
#include "absl/types/span.h"
#include "ortools/graph/christofides.h"
#include "ortools/graph/graph.h"
#include "ortools/graph/minimum_spanning_tree.h"

Go to the source code of this file.

Functions

trees with all degrees equal w the current value of int step1_ (0)
trees with all degrees equal w the current value of int iteration_ (0)
trees with all degrees equal w the current value of int max_iterations_ (max_iterations > 0 ? max_iterations :MaxIterations(number_of_nodes))
trees with all degrees equal w the current value of int number_of_nodes_ (number_of_nodes)
bool Next ()
double GetStep () const
void OnOneTree (CostType one_tree_cost, double w, absl::Span< const int > degrees)
void OnNewWMax (CostType one_tree_cost)

Variables

trees with all degrees equal to
trees with all degrees equal therefore
trees with all degrees equal w the current value of w
trees with all degrees equal w the current value of degrees
trees with all degrees equal w the current value of int max_iterations

Function Documentation

◆ GetStep()

double GetStep ( ) const

Definition at line 169 of file one_tree_lower_bound.h.

◆ iteration_()

trees with all degrees equal w the current value of int iteration_ ( 0 )

◆ max_iterations_()

trees with all degrees equal w the current value of int max_iterations_ ( max_iterations ,
0 ? max_iterations :MaxIterationsnumber_of_nodes )

◆ Next()

bool Next ( )

Definition at line 167 of file one_tree_lower_bound.h.

◆ number_of_nodes_()

trees with all degrees equal w the current value of int number_of_nodes_ ( number_of_nodes )

Definition at line 165 of file one_tree_lower_bound.h.

◆ OnNewWMax()

void OnNewWMax ( CostType one_tree_cost)

Definition at line 187 of file one_tree_lower_bound.h.

◆ OnOneTree()

void OnOneTree ( CostType one_tree_cost,
double w,
absl::Span< const int > degrees )

Definition at line 179 of file one_tree_lower_bound.h.

◆ step1_()

trees with all degrees equal w the current value of int step1_ ( 0 )

Variable Documentation

◆ degrees

trees with all degrees equal w the current value of degrees

Definition at line 149 of file one_tree_lower_bound.h.

◆ max_iterations

trees with all degrees equal w the current value of int max_iterations

Definition at line 159 of file one_tree_lower_bound.h.

◆ therefore

trees with all degrees equal therefore

Definition at line 34 of file one_tree_lower_bound.h.

◆ to

trees with all degrees equal to

Definition at line 34 of file one_tree_lower_bound.h.

◆ w

trees with all degrees equal w the current value of w

Definition at line 148 of file one_tree_lower_bound.h.