This is a type of Network Optimisation Problem. It may arise in different contexts:

__Networks__: Routing as many packets as possible on a given Network.__Transportation__: Sending as many trucks as possible where roads have limits on the number of trucks per unit time.__Bridges__: destroying (?!) some bridges to disconnect s from t while minimising the cost of destroying the bridges.

## Problem[]

This problem includes finding a feasible flow through a single source, single sink flow network that is maximum.

__Given__: A directed graph G(V, E), where each edge is associated with a capacity c(e) > 0. There are two special nodes source 's' and sink 't' (s ≠ t)

__Problem__: Maximise the total amount of flow from s to t subject to two constraints:

- Flow on an edge e does not exceed c(e).
- Foe every node v ≠ s,t, incoming flow is equal to outgoing flow.

## Algorithms[]

There are two efficient Algorithms: