Let u be an undirected pat th from s to t (1When u is a directed path from s to t, iffic for every edge of the path, then we change for every edge of the path, which equals minc lAbel s with(-,AS), where As=too 2)Suppose that vertex i is labeled, Let be an adjacent vertex of i, and no labeled. If fisc thenj is labeled (it, Aj, where Aj= min ai, 3)If t is labeled, then an increasing flow is constructed. We change fi to fi +At for every edge of the path u.▪ Let u be an undirected path from s to t, ▪ (1)When u is a directed path from s to t, if fij<cij for every edge of the path, then we change fij for every edge of the path, which equals min{cij-fij} ▪ 1)Label s with (-,Δs), where Δs=+∞ ▪ 2)Suppose that vertex i is labeled, Let j be an adjacent vertex of i, and no labeled. If fij<cij， then j is labeled (i+ , Δj), where Δj = min{Δi， cij- fij} ▪ 3)If t is labeled, then an increasing flow is constructed. We change fij to fij +Δt for every edge of the path u