\setcounter{AlgoLine}{0}
\DontPrintSemicolon
	\KwIn{Oriented network $R = (V, E, w, c)$ without negative circuit, a source-node $s$ and a sink-node $t$}
	\KwResult{Maximum flow with minimum cost from $s$ to $t$}
	Start with a null flow in all the arcs\\
	\Repeat{there is no path from $s$ to $t$ in $R^*$}
	{
		Build the residual network $R^*$ relative to the current flow\\
		\If{A path form $s$ to $t$ exists in $R^*$}
		{Find the maximal possible flow through the \textcolor{myevidence}{shortest} path from $s$ to $t$ in $R^*$\\
			Superimpose this flow on the current flow }
	}

