modify code

Author: algorithmzuo

src/class47/Code03_DinicAlgorithm.java

@@ -57,6 +57,7 @@ public int maxFlow(int s, int t) {
 while (bfs(s, t)) {
 Arrays.fill(cur, 0);
 flow += dfs(s, t, Integer.MAX_VALUE);
+Arrays.fill(depth, 0);
 }
 return flow;
 }
@@ -67,14 +68,16 @@ private boolean bfs(int s, int t) {
 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));
 int v = e.to;
 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 @@ private int dfs(int s, int t, int r) {
 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 @@ private int dfs(int s, int t, int r) {
 }
 return flow;
 }
-
 }
 
 public static void main(String[] args) {