Google OR-Tools v9.15
a fast and portable software suite for combinatorial optimization
Loading...
Searching...
No Matches
min_cost_flow.cc File Reference
#include "ortools/graph/min_cost_flow.h"
#include <algorithm>
#include <cmath>
#include <cstdint>
#include <cstdlib>
#include <limits>
#include <memory>
#include <string>
#include <vector>
#include "absl/base/attributes.h"
#include "absl/flags/flag.h"
#include "absl/log/check.h"
#include "absl/log/log.h"
#include "absl/strings/str_format.h"
#include "absl/strings/string_view.h"
#include "ortools/base/mathutil.h"
#include "ortools/graph/generic_max_flow.h"
#include "ortools/graph/graph.h"
#include "ortools/util/saturated_arithmetic.h"
#include "ortools/util/stats.h"

Go to the source code of this file.

Namespaces

namespace  operations_research
 OR-Tools root namespace.

Functions

 ABSL_FLAG (int64_t, min_cost_flow_alpha, 5, "Divide factor for epsilon at each refine step.")
 ABSL_FLAG (bool, min_cost_flow_check_feasibility, true, "Check that the graph has enough capacity to send all supplies " "and serve all demands. Also check that the sum of supplies " "is equal to the sum of demands.")
 ABSL_FLAG (bool, min_cost_flow_check_result, true, "Check that the result is valid.")

Function Documentation

◆ ABSL_FLAG() [1/3]

ABSL_FLAG ( bool ,
min_cost_flow_check_feasibility ,
true ,
"Check that the graph has enough capacity to send all supplies " "and serve all demands. Also check that the sum of supplies " "is equal to the sum of demands."  )

◆ ABSL_FLAG() [2/3]

ABSL_FLAG ( bool ,
min_cost_flow_check_result ,
true ,
"Check that the result is valid."  )

◆ ABSL_FLAG() [3/3]

ABSL_FLAG ( int64_t ,
min_cost_flow_alpha ,
5 ,
"Divide factor for epsilon at each refine step."  )