Google OR-Tools v9.11
a fast and portable software suite for combinatorial optimization
|
#include <cstdint>
#include <functional>
#include <string>
#include <utility>
#include <vector>
#include "absl/status/status.h"
#include "absl/status/statusor.h"
#include "ortools/base/logging.h"
#include "ortools/graph/eulerian_path.h"
#include "ortools/graph/graph.h"
#include "ortools/graph/minimum_spanning_tree.h"
#include "ortools/graph/perfect_matching.h"
#include "ortools/linear_solver/linear_solver.h"
#include "ortools/linear_solver/linear_solver.pb.h"
#include "ortools/util/saturated_arithmetic.h"
Go to the source code of this file.
Classes | |
class | operations_research::ChristofidesPathSolver< CostType, ArcIndex, NodeIndex, CostFunction > |
Namespaces | |
namespace | operations_research |
In SWIG mode, we don't want anything besides these top-level includes. | |
Functions | |
template<typename WeightFunctionType , typename GraphType > | |
absl::StatusOr< std::vector< std::pair< typename GraphType::NodeIndex, typename GraphType::NodeIndex > > > | operations_research::ComputeMinimumWeightMatching (const GraphType &graph, const WeightFunctionType &weight) |
Computes a minimum weight perfect matching on an undirected graph. | |
template<typename WeightFunctionType , typename GraphType > | |
absl::StatusOr< std::vector< std::pair< typename GraphType::NodeIndex, typename GraphType::NodeIndex > > > | operations_research::ComputeMinimumWeightMatchingWithMIP (const GraphType &graph, const WeightFunctionType &weight) |