Google OR-Tools: ortools/graph/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 |
◆ GetStep()
◆ iteration_()
◆ max_iterations_()
| trees with all degrees equal w the current value of int max_iterations_ | ( | max_iterations | , |
| 0 ? max_iterations | :MaxIterationsnumber_of_nodes ) |
◆ Next()
◆ number_of_nodes_()
◆ OnNewWMax()
| void OnNewWMax | ( | CostType | one_tree_cost | ) |
◆ OnOneTree()
| void OnOneTree | ( | CostType | one_tree_cost, |
| double | w, | ||
| absl::Span< const int > | degrees ) |
◆ step1_()
◆ degrees
trees with all degrees equal w the current value of degrees
◆ max_iterations
◆ therefore
trees with all degrees equal therefore
◆ to
trees with all degrees equal to
◆ w
trees with all degrees equal w the current value of w