From a2e2e76a3901889fc7b4747eca120663fecb1028 Mon Sep 17 00:00:00 2001
From: algorithmzuo <algorithmzuo@163.com>
Date: Fri, 16 Apr 2021 10:57:52 +0800
Subject: [PATCH] modify code

---
 src/class47/Code03_DinicAlgorithm.java | 9 ++++-----
 1 file changed, 4 insertions(+), 5 deletions(-)

diff --git a/src/class47/Code03_DinicAlgorithm.java b/src/class47/Code03_DinicAlgorithm.java
index cc118ed..efed284 100644
--- a/src/class47/Code03_DinicAlgorithm.java
+++ b/src/class47/Code03_DinicAlgorithm.java
@@ -57,6 +57,7 @@ public class Code03_DinicAlgorithm {
 			while (bfs(s, t)) {
 				Arrays.fill(cur, 0);
 				flow += dfs(s, t, Integer.MAX_VALUE);
+				Arrays.fill(depth, 0);
 			}
 			return flow;
 		}
@@ -67,7 +68,6 @@ public class Code03_DinicAlgorithm {
 			boolean[] visited = new boolean[N];
 			visited[s] = true;
 			while (!queue.isEmpty()) {
-				// u是当前节点
 				int u = queue.pollLast();
 				for (int i = 0; i < nexts.get(u).size(); i++) {
 					Edge e = edges.get(nexts.get(u).get(i));
@@ -75,6 +75,9 @@ public class Code03_DinicAlgorithm {
 					if (!visited[v] && e.available > 0) {
 						visited[v] = true;
 						depth[v] = depth[u] + 1;
+						if (v == t) {
+							break;
+						}
 						queue.addFirst(v);
 					}
 				}
@@ -90,9 +93,6 @@ public class Code03_DinicAlgorithm {
 			if (s == t || r == 0) {
 				return r;
 			}
-			if (depth[s] >= depth[t]) {
-				return 0;
-			}
 			int f = 0;
 			int flow = 0;
 			// s点从哪条边开始试 -> cur[s]
@@ -112,7 +112,6 @@ public class Code03_DinicAlgorithm {
 			}
 			return flow;
 		}
-
 	}
 
 	public static void main(String[] args) {