\setcounter{AlgoLine}{0}
\DontPrintSemicolon
	\KwIn{Oriented network $R = (V, E, w)$, a source-node $s$ and a sink-node $t$}
	\KwResult{Maximum flow from $s$ to $t$}
	Starts with a null flow in all arcs\\
	\Repeat{there is no path from $s$ to $t$ in $R^*$}
	{
		Build the residual network $R^*$ corresponding to the current flow\\
		\If{There is a path from $s$ to $t$ in $R^*$}
		{Find the maximal possible flow from $s$ to $t$ in $R^*$ along this path\\
			Superimpose this flow on the current flow (diminish the flow in the arcs $(i,j)$ of $R$ appearing as $(j,i)$ arcs on the  path in $R^*$)}
	}

