[ library(max_flow_eplex) | Reference Manual | Alphabetic Index ]

# max_flow_eplex(+Graph, +CapacityArg, +SourceNode, +SinkNode, -MaxFlowValue)

Linear programming solution for maximum flow problem

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

## 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