Uses of Class
org.jgrapht.alg.flow.mincost.CapacityScalingMinimumCostFlow.Node
-
Packages that use CapacityScalingMinimumCostFlow.Node Package Description org.jgrapht.alg.flow.mincost Algorithms for minimum cost flow -
-
Uses of CapacityScalingMinimumCostFlow.Node in org.jgrapht.alg.flow.mincost
Fields in org.jgrapht.alg.flow.mincost declared as CapacityScalingMinimumCostFlow.Node Modifier and Type Field Description (package private) 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.Node Modifier and Type Field Description (package private) org.jheaps.AddressableHeap.Handle<java.lang.Double,CapacityScalingMinimumCostFlow.Node>
CapacityScalingMinimumCostFlow.Node. handle
Reference to theFibonacciHeapNode
this node is contained inMethods in org.jgrapht.alg.flow.mincost that return types with arguments of type CapacityScalingMinimumCostFlow.Node Modifier and Type Method Description private Pair<java.util.List<CapacityScalingMinimumCostFlow.Node>,java.util.Set<CapacityScalingMinimumCostFlow.Node>>
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.private Pair<java.util.List<CapacityScalingMinimumCostFlow.Node>,java.util.Set<CapacityScalingMinimumCostFlow.Node>>
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.Node Modifier and Type Method Description (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, java.util.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.Node Modifier and Type Method Description private void
CapacityScalingMinimumCostFlow. pushAllFlow(java.util.List<CapacityScalingMinimumCostFlow.Node> positiveExcessNodes, java.util.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(java.util.List<CapacityScalingMinimumCostFlow.Node> positiveExcessNodes, java.util.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, java.util.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.Node Constructor Description Arc(CapacityScalingMinimumCostFlow.Node head, int residualCapacity, double cost)
Creates a new arc
-