[ library(max_flow_eplex) | Reference Manual | Alphabetic Index ]
max_flow_eplex_dual(+Graph, +CapacityArg, +SourceNode, +SinkNode, -MaxFlowValue, -MinCutNodes, -MinCutEdges)
Linear programming solution for maximum flow problem, dual linear program. Outputs the cut as nodes and edges.
- Graph
- a graph structure, no parallel edges, e(Src,Dest,EdgeData)
- CapacityArg
- which argument of EdgeData to use as edge capacity (integer), (0 if EdgeData is a single number and -1 if every edge capacity is 1)
- SourceNode
- source node number (integer)
- SinkNode
- sink node number (integer)
- MaxFlowValue
- value of the maximum flow
- MinCutNodes
- List of nodes that belong to the source side of the minimum cost cut
- MinCutEdges
- List of edges of the minimum cost cut
See Also
max_flow : max_flow / 5, max_flow : max_flow / 7, max_flow_eplex / 5, max_flow_eplex_dual / 5, max_flow_eplex_dual / 7, all_min_cuts : all_min_cuts / 8, all_min_cuts : all_min_cuts / 9, all_min_cuts : all_min_cuts_list / 5, all_min_cuts_eplex : all_min_cuts_eplex / 7, all_min_cuts_eplex : all_min_cuts_eplex / 8