@ -62,7 +62,6 @@ public class Code03_DinicAlgorithm {
}
private boolean bfs(int s, int t) {
depth[s] = 0;
LinkedList<Integer> queue = new LinkedList<>();
queue.addFirst(s);
boolean[] visited = new boolean[N];