Uses of Class
org.jgrapht.alg.flow.mincost.CapacityScalingMinimumCostFlow.Node
Packages that use CapacityScalingMinimumCostFlow.Node
-
Uses of CapacityScalingMinimumCostFlow.Node in org.jgrapht.alg.flow.mincost
Fields in org.jgrapht.alg.flow.mincost declared as CapacityScalingMinimumCostFlow.NodeModifier and TypeFieldDescription(package private) final CapacityScalingMinimumCostFlow.Node
CapacityScalingMinimumCostFlow.Arc.head
The head (target) of this arc.private CapacityScalingMinimumCostFlow.Node[]
CapacityScalingMinimumCostFlow.nodes
Array of internal nodes used by the algorithm.Fields in org.jgrapht.alg.flow.mincost with type parameters of type CapacityScalingMinimumCostFlow.NodeModifier and TypeFieldDescription(package private) org.jheaps.AddressableHeap.Handle
<Double, CapacityScalingMinimumCostFlow.Node> CapacityScalingMinimumCostFlow.Node.handle
Reference to theinvalid reference
FibonacciHeapNode
Methods in org.jgrapht.alg.flow.mincost that return types with arguments of type CapacityScalingMinimumCostFlow.NodeModifier and TypeMethodDescriptionCapacityScalingMinimumCostFlow.scale
(int delta) Performs a scaling phase by saturating all negative reduced cost arcs with residual capacity greater than or equal to thedelta
, so that they don't belong to the $\Delta$-residual network and, hence, don't violate optimality conditions.CapacityScalingMinimumCostFlow.scale
(int delta) Performs a scaling phase by saturating all negative reduced cost arcs with residual capacity greater than or equal to thedelta
, so that they don't belong to the $\Delta$-residual network and, hence, don't violate optimality conditions.Methods in org.jgrapht.alg.flow.mincost with parameters of type CapacityScalingMinimumCostFlow.NodeModifier and TypeMethodDescription(package private) CapacityScalingMinimumCostFlow.Arc
CapacityScalingMinimumCostFlow.Node.addArcTo
(CapacityScalingMinimumCostFlow.Node opposite, int capacity, double cost) Adds a new arc withcapacity
,cost
to theopposite
.private void
CapacityScalingMinimumCostFlow.augmentPath
(CapacityScalingMinimumCostFlow.Node start, CapacityScalingMinimumCostFlow.Node end) Augments the path fromstart
to theend
sending as much flow as possible.private void
CapacityScalingMinimumCostFlow.pushDijkstra
(CapacityScalingMinimumCostFlow.Node start, Set<CapacityScalingMinimumCostFlow.Node> negativeExcessNodes, int delta) Runs the Dijkstra's algorithm in the residual network usingCapacityScalingMinimumCostFlow.Arc.getReducedCost()
as arc distances.Method parameters in org.jgrapht.alg.flow.mincost with type arguments of type CapacityScalingMinimumCostFlow.NodeModifier and TypeMethodDescriptionprivate void
CapacityScalingMinimumCostFlow.pushAllFlow
(List<CapacityScalingMinimumCostFlow.Node> positiveExcessNodes, Set<CapacityScalingMinimumCostFlow.Node> negativeExcessNodes, int delta) For every node in thepositiveExcessNodes
pushes all flow away from it until its excess is less thandelta
.private void
CapacityScalingMinimumCostFlow.pushAllFlow
(List<CapacityScalingMinimumCostFlow.Node> positiveExcessNodes, Set<CapacityScalingMinimumCostFlow.Node> negativeExcessNodes, int delta) For every node in thepositiveExcessNodes
pushes all flow away from it until its excess is less thandelta
.private void
CapacityScalingMinimumCostFlow.pushDijkstra
(CapacityScalingMinimumCostFlow.Node start, Set<CapacityScalingMinimumCostFlow.Node> negativeExcessNodes, int delta) Runs the Dijkstra's algorithm in the residual network usingCapacityScalingMinimumCostFlow.Arc.getReducedCost()
as arc distances.Constructors in org.jgrapht.alg.flow.mincost with parameters of type CapacityScalingMinimumCostFlow.NodeModifierConstructorDescription(package private)
Arc
(CapacityScalingMinimumCostFlow.Node head, int residualCapacity, double cost) Creates a new arc