Google OR-Tools v9.11
a fast and portable software suite for combinatorial optimization
Loading...
Searching...
No Matches
operations_research::GenericMinCostFlow< Graph, ArcFlowType, ArcScaledCostType > Member List

This is the complete list of members for operations_research::GenericMinCostFlow< Graph, ArcFlowType, ArcScaledCostType >, including all inherited members.

ArcIndex typedefoperations_research::GenericMinCostFlow< Graph, ArcFlowType, ArcScaledCostType >
ArcIndexArray typedefoperations_research::GenericMinCostFlow< Graph, ArcFlowType, ArcScaledCostType >
BAD_COST_RANGE enum valueoperations_research::MinCostFlowBase
BAD_RESULT enum valueoperations_research::MinCostFlowBase
Capacity(ArcIndex arc) constoperations_research::GenericMinCostFlow< Graph, ArcFlowType, ArcScaledCostType >
CheckFeasibility(std::vector< NodeIndex > *infeasible_supply_node, std::vector< NodeIndex > *infeasible_demand_node)operations_research::GenericMinCostFlow< Graph, ArcFlowType, ArcScaledCostType >
FEASIBLE enum valueoperations_research::MinCostFlowBase
FeasibleSupply(NodeIndex node) constoperations_research::GenericMinCostFlow< Graph, ArcFlowType, ArcScaledCostType >
Flow(ArcIndex arc) constoperations_research::GenericMinCostFlow< Graph, ArcFlowType, ArcScaledCostType >
GenericMinCostFlow(const Graph *graph)operations_research::GenericMinCostFlow< Graph, ArcFlowType, ArcScaledCostType >explicit
GenericMinCostFlow(const GenericMinCostFlow &)=deleteoperations_research::GenericMinCostFlow< Graph, ArcFlowType, ArcScaledCostType >
GetOptimalCost()operations_research::GenericMinCostFlow< Graph, ArcFlowType, ArcScaledCostType >
graph() constoperations_research::GenericMinCostFlow< Graph, ArcFlowType, ArcScaledCostType >inline
INFEASIBLE enum valueoperations_research::MinCostFlowBase
InitialSupply(NodeIndex node) constoperations_research::GenericMinCostFlow< Graph, ArcFlowType, ArcScaledCostType >
MakeFeasible()operations_research::GenericMinCostFlow< Graph, ArcFlowType, ArcScaledCostType >
NodeIndex typedefoperations_research::GenericMinCostFlow< Graph, ArcFlowType, ArcScaledCostType >
NOT_SOLVED enum valueoperations_research::MinCostFlowBase
operator=(const GenericMinCostFlow &)=deleteoperations_research::GenericMinCostFlow< Graph, ArcFlowType, ArcScaledCostType >
OPTIMAL enum valueoperations_research::MinCostFlowBase
OutgoingArcIterator typedefoperations_research::GenericMinCostFlow< Graph, ArcFlowType, ArcScaledCostType >
OutgoingOrOppositeIncomingArcIterator typedefoperations_research::GenericMinCostFlow< Graph, ArcFlowType, ArcScaledCostType >
SetArcCapacity(ArcIndex arc, ArcFlowType new_capacity)operations_research::GenericMinCostFlow< Graph, ArcFlowType, ArcScaledCostType >
SetArcFlow(ArcIndex arc, ArcFlowType new_flow)operations_research::GenericMinCostFlow< Graph, ArcFlowType, ArcScaledCostType >
SetArcUnitCost(ArcIndex arc, ArcScaledCostType unit_cost)operations_research::GenericMinCostFlow< Graph, ArcFlowType, ArcScaledCostType >
SetCheckFeasibility(bool value)operations_research::GenericMinCostFlow< Graph, ArcFlowType, ArcScaledCostType >inline
SetNodeSupply(NodeIndex node, FlowQuantity supply)operations_research::GenericMinCostFlow< Graph, ArcFlowType, ArcScaledCostType >
SetPriceScaling(bool value)operations_research::GenericMinCostFlow< Graph, ArcFlowType, ArcScaledCostType >inline
SetUseUpdatePrices(bool value)operations_research::GenericMinCostFlow< Graph, ArcFlowType, ArcScaledCostType >inline
Solve()operations_research::GenericMinCostFlow< Graph, ArcFlowType, ArcScaledCostType >
Status enum nameoperations_research::MinCostFlowBase
status() constoperations_research::GenericMinCostFlow< Graph, ArcFlowType, ArcScaledCostType >inline
Supply(NodeIndex node) constoperations_research::GenericMinCostFlow< Graph, ArcFlowType, ArcScaledCostType >
UNBALANCED enum valueoperations_research::MinCostFlowBase
UnitCost(ArcIndex arc) constoperations_research::GenericMinCostFlow< Graph, ArcFlowType, ArcScaledCostType >