public class MinCostFlow extends MinCostFlowBase
MinCostFlowBase.Status
swigCMemOwn
Modifier | Constructor and Description |
---|---|
|
MinCostFlow() |
|
MinCostFlow(int reserve_num_nodes) |
|
MinCostFlow(int reserve_num_nodes,
int reserve_num_arcs) |
protected |
MinCostFlow(long cPtr,
boolean cMemoryOwn) |
Modifier and Type | Method and Description |
---|---|
int |
addArcWithCapacityAndUnitCost(int tail,
int head,
long capacity,
long unit_cost) |
void |
delete() |
protected void |
finalize() |
long |
getCapacity(int arc) |
protected static long |
getCPtr(MinCostFlow obj) |
long |
getFlow(int arc) |
int |
getHead(int arc) |
long |
getMaximumFlow() |
int |
getNumArcs() |
int |
getNumNodes() |
long |
getOptimalCost() |
long |
getSupply(int node) |
int |
getTail(int arc) |
long |
getUnitCost(int arc) |
void |
setArcCapacity(int arc,
long capacity) |
void |
setNodeSupply(int node,
long supply) |
MinCostFlowBase.Status |
solve() |
MinCostFlowBase.Status |
solveMaxFlowWithMinCost() |
protected static long |
swigRelease(MinCostFlow obj) |
getCPtr, swigRelease
protected MinCostFlow(long cPtr, boolean cMemoryOwn)
public MinCostFlow(int reserve_num_nodes, int reserve_num_arcs)
public MinCostFlow(int reserve_num_nodes)
public MinCostFlow()
protected static long getCPtr(MinCostFlow obj)
protected static long swigRelease(MinCostFlow obj)
protected void finalize()
finalize
in class MinCostFlowBase
public void delete()
delete
in class MinCostFlowBase
public int addArcWithCapacityAndUnitCost(int tail, int head, long capacity, long unit_cost)
public void setArcCapacity(int arc, long capacity)
public void setNodeSupply(int node, long supply)
public MinCostFlowBase.Status solve()
public MinCostFlowBase.Status solveMaxFlowWithMinCost()
public long getOptimalCost()
public long getMaximumFlow()
public long getFlow(int arc)
public int getNumNodes()
public int getNumArcs()
public int getTail(int arc)
public int getHead(int arc)
public long getCapacity(int arc)
public long getSupply(int node)
public long getUnitCost(int arc)
Copyright © 2025. All rights reserved.