ortools.graph.python.min_cost_flow
add_arc_with_capacity_and_unit_cost(self: SimpleMinCostFlow, tail: int, head: int, capacity: int, unit_cost: int) -> int
add_arcs_with_capacity_and_unit_cost(self: SimpleMinCostFlow, arg0: numpy.ndarray[numpy.int32], arg1: numpy.ndarray[numpy.int32], arg2: numpy.ndarray[numpy.int64], arg3: numpy.ndarray[numpy.int64]) -> object
set_node_supply(self: SimpleMinCostFlow, node: int, supply: int) -> None
set_nodes_supplies(self: SimpleMinCostFlow, arg0: numpy.ndarray[numpy.int32], arg1: numpy.ndarray[numpy.int64]) -> object
solve(self: SimpleMinCostFlow) -> operations_research::MinCostFlowBase::Status
solve_max_flow_with_min_cost(self: SimpleMinCostFlow) -> operations_research::MinCostFlowBase::Status
flows(self: SimpleMinCostFlow, arg0: numpy.ndarray[numpy.int32]) -> object
Members:
BAD_COST_RANGE
BAD_RESULT
FEASIBLE
INFEASIBLE
NOT_SOLVED
OPTIMAL
UNBALANCED