Uses of Class
org.jacop.constraints.netflow.simplex.Node
Packages that use Node
-
Uses of Node in org.jacop.constraints.netflow
Fields in org.jacop.constraints.netflow with type parameters of type NodeMethods in org.jacop.constraints.netflow that return NodeModifier and TypeMethodDescriptionNetworkBuilder.addNode()
NetworkBuilder.addNode
(int balance) Node[][]
NetworkBuilder.valueGraph
(IntVar[] vars, IntDomain[] domains) Returns two arrays containing the nodes for each variable and the nodes for each domain, respectively.Methods in org.jacop.constraints.netflow with parameters of type NodeModifier and TypeMethodDescriptionConstructor parameters in org.jacop.constraints.netflow with type arguments of type Node -
Uses of Node in org.jacop.constraints.netflow.simplex
Fields in org.jacop.constraints.netflow.simplex declared as NodeModifier and TypeFieldDescriptionfinal Node
Arc.head
The head of the arc (where the arc points to).final Node[]
NetworkSimplex.nodes
Node.parent
final Node
NetworkSimplex.root
Node.thread
Fields in org.jacop.constraints.netflow.simplex with type parameters of type NodeMethods in org.jacop.constraints.netflow.simplex that return NodeModifier and TypeMethodDescriptionFinds the root of the smallest subtree that contains both this node and that node.Node.predecessorOnThread()
Finds the predecessor of this node on the thread.Node.rightMostLeaf()
Finds the last node on the thread that has a larger depth than this node.Arc.tail()
Methods in org.jacop.constraints.netflow.simplex with parameters of type NodeModifier and TypeMethodDescriptionint
NetworkSimplex.augmentFlow
(Node from, Node to, int delta) Augments the flow between two nodes by the maximum amount along the unique tree path that connects these nodes.private void
NetworkSimplex.decrementDegree
(Node node) private void
NetworkSimplex.incrementDegree
(Node node, Arc myArc) Finds the root of the smallest subtree that contains both this node and that node.int
NetworkSimplex.parametricStep
(Node source, Node sink, int balance, int maxPivots) Given an optimal flow that satisfies all feasibility constraints except mass balance on two nodes, the parametric simplex algorithm tries to achieve feasibility while keeping the solution optimal.void
TODO prove (or disprove) correctnessConstructors in org.jacop.constraints.netflow.simplex with parameters of type NodeModifierConstructorDescriptionprivate
Special constructor to create artificial arcs.General constructor to create arcs.Constructor parameters in org.jacop.constraints.netflow.simplex with type arguments of type Node