public class NetworkBuilder extends Object
Modifier and Type | Field and Description |
---|---|
List<Arc> |
arcList |
IntVar |
costVariable |
List<VarHandler> |
handlerList |
List<Node> |
nodeList |
Constructor and Description |
---|
NetworkBuilder() |
NetworkBuilder(IntVar costVariable) |
Modifier and Type | Method and Description |
---|---|
Arc |
addArc(Node from,
Node to) |
Arc |
addArc(Node from,
Node to,
int weight) |
Arc |
addArc(Node from,
Node to,
int weight,
int capacity) |
Arc |
addArc(Node from,
Node to,
int weight,
int lowerCapacity,
int upperCapacity) |
Arc |
addArc(Node from,
Node to,
int weight,
IntVar xVar) |
Arc |
addArc(Node from,
Node to,
IntVar wVar,
int lowerCapacity,
int upperCapacity) |
Arc |
addArc(Node from,
Node to,
IntVar wVar,
IntVar xVar) |
Node |
addNode() |
Node |
addNode(int balance) |
Node |
addNode(String name) |
Node |
addNode(String name,
int balance) |
NetworkFlow |
build() |
ArrayList<IntVar> |
listVariables() |
ArrayList<Constraint> |
primitiveDecomposition(Store store)
Generally speaking, especially in case of multiple arcs between
two nodes and structure constraints imposed on arcs makes it hard
to decompose network flow constraint into primitive ones.
|
void |
setCostVariable(IntVar costVariable) |
Node[][] |
valueGraph(IntVar[] vars,
IntDomain[] domains)
Returns two arrays containing the nodes for each variable and the nodes
for each domain, respectively.
|
public IntVar costVariable
public final List<VarHandler> handlerList
public NetworkBuilder()
public NetworkBuilder(IntVar costVariable)
public void setCostVariable(IntVar costVariable)
public Node addNode()
public Node addNode(int balance)
public Node[][] valueGraph(IntVar[] vars, IntDomain[] domains)
public NetworkFlow build()
public ArrayList<Constraint> primitiveDecomposition(Store store)
store
- Copyright © 2015. All rights reserved.