|
override void | Dispose (bool disposing) |
|
Definition at line 15 of file MinCostFlow.cs.
◆ MinCostFlow() [1/3]
Google.OrTools.Graph.MinCostFlow.MinCostFlow |
( |
int | reserve_num_nodes, |
|
|
int | reserve_num_arcs ) |
|
inline |
◆ MinCostFlow() [2/3]
Google.OrTools.Graph.MinCostFlow.MinCostFlow |
( |
int | reserve_num_nodes | ) |
|
|
inline |
◆ MinCostFlow() [3/3]
Google.OrTools.Graph.MinCostFlow.MinCostFlow |
( |
| ) |
|
|
inline |
◆ AddArcWithCapacityAndUnitCost()
int Google.OrTools.Graph.MinCostFlow.AddArcWithCapacityAndUnitCost |
( |
int | tail, |
|
|
int | head, |
|
|
long | capacity, |
|
|
long | unit_cost ) |
|
inline |
◆ Capacity()
long Google.OrTools.Graph.MinCostFlow.Capacity |
( |
int | arc | ) |
|
|
inline |
◆ Dispose()
override void Google.OrTools.Graph.MinCostFlow.Dispose |
( |
bool | disposing | ) |
|
|
inlineprotectedvirtual |
◆ Flow()
long Google.OrTools.Graph.MinCostFlow.Flow |
( |
int | arc | ) |
|
|
inline |
◆ Head()
int Google.OrTools.Graph.MinCostFlow.Head |
( |
int | arc | ) |
|
|
inline |
◆ MaximumFlow()
long Google.OrTools.Graph.MinCostFlow.MaximumFlow |
( |
| ) |
|
|
inline |
◆ NumArcs()
int Google.OrTools.Graph.MinCostFlow.NumArcs |
( |
| ) |
|
|
inline |
◆ NumNodes()
int Google.OrTools.Graph.MinCostFlow.NumNodes |
( |
| ) |
|
|
inline |
◆ OptimalCost()
long Google.OrTools.Graph.MinCostFlow.OptimalCost |
( |
| ) |
|
|
inline |
◆ SetNodeSupply()
void Google.OrTools.Graph.MinCostFlow.SetNodeSupply |
( |
int | node, |
|
|
long | supply ) |
|
inline |
◆ Solve()
◆ SolveMaxFlowWithMinCost()
◆ Supply()
long Google.OrTools.Graph.MinCostFlow.Supply |
( |
int | node | ) |
|
|
inline |
◆ Tail()
int Google.OrTools.Graph.MinCostFlow.Tail |
( |
int | arc | ) |
|
|
inline |
◆ UnitCost()
long Google.OrTools.Graph.MinCostFlow.UnitCost |
( |
int | arc | ) |
|
|
inline |
The documentation for this class was generated from the following file: