Algorithm 1 Network Maximum Flow.

Require:$ENN,s,t$ Ensure:f

1: conversion the edge network into a directed edge network from s to t

2: initialize flow f to 0

3: while there exists a path p between s and t do

4:    if all $e\in p$ and $f\left(e\right)<c_e$ then

5:      augment flow $f\left(e\right)$ along p

6:     end if

7: end while

8: return f