[ Reference Manual | Alphabetic Index ]

# library(max_flow)

Ford-Fulkerson maximum flow algorithm

## Predicates

> feas_flow_with_lb(+Graph, +LowerBoundArg, +CapacityArg, +SourceNode, +SinkNode, -FlowValue, -FlowEdges, -FlowEdgesGraph)
>   Finds a feasible flow for a network with non-negative lower-bounds imposed on the edge flows,using an adapted Ford-Fulkerson maximum flow algorithm
> max_flow(+Graph, +CapacityArg, +SourceNode, +SinkNode, -MaxFlowValue)
>   Ford-Fulkerson maximum flow algorithm
> max_flow(+Graph, +CapacityArg, +SourceNode, +SinkNode, -MaxFlowValue, -MaxFlowEdges, -MaxFlowEdgesGraph)
>   Ford-Fulkerson maximum flow algorithm
> max_flow_with_lb(+Graph, +LowerBoundArg, +CapacityArg, +SourceNode, +SinkNode, -MaxFlowValue)
>   Finds rhe maximum flow for a network with non-negative lower-bounds imposed on the edge flows,using an adapted Ford-Fulkerson maximum flow algorithm
> max_flow_with_lb(+Graph, +LowerBoundArg, +CapacityArg, +SourceNode, +SinkNode, -MaxFlowValue, -MaxFlowEdges, -MaxFlowEdgesGraph)
>   Finds rhe maximum flow for a network with non-negative lower-bounds imposed on the edge flows,using an adapted Ford-Fulkerson maximum flow algorithm

## About

- Status: prototype
- Author: CrossCore Optimization Ltd
- Copyright © 2007, CrossCore Optimization Ltd
- Date: 2006-2007

Generated from max_flow.eci on 2020-02-26 22:26