10:T414,function edmondsKarp(capacity: number[][], source: number, sink: number): number { const n = capacity.length; const flow = capacity.map((row) => row.map(() => 0)); const parent = new Array(n).fill(-1); const bfs = (): boolean => { parent.fill(-1); const queue: number[] = [source]; parent[source] = source; while (queue.length) { const u = queue.shift()!; for (let v = 0; v < n; v += 1) { if (parent[v] === -1 && capacity[u][v] - flow[u][v] > 0) { parent[v] = u; if (v === sink) return true; queue.push(v); } } } return false; }; let maxFlow = 0; while (bfs()) { let pathFlow = Infinity; for (let v = sink; v !== source; v = parent[v]) { const u = parent[v]; pathFlow = Math.min(pathFlow, capacity[u][v] - flow[u][v]); } for (let v = sink; v !== source; v = parent[v]) { const u = parent[v]; flow[u][v] += pathFlow; flow[v][u] -= pathFlow; } maxFlow += pathFlow; } return maxFlow; }11:T4de,public int edmondsKarp(int[][] capacity, int source, int sink) { int n = capacity.length; int[][] flow = new int[n][n]; int[] parent = new int[n]; java.util.function.Supplier bfs = () -> { java.util.Arrays.fill(parent, -1); java.util.Queue queue = new java.util.ArrayDeque<>(); queue.add(source); parent[source] = source; while (!queue.isEmpty()) { int u = queue.poll(); for (int v = 0; v < n; v++) { if (parent[v] == -1 && capacity[u][v] - flow[u][v] > 0) { parent[v] = u; if (v == sink) return true; queue.add(v); } } } return false; }; int maxFlow = 0; while (bfs.get()) { int pathFlow = Integer.MAX_VALUE; for (int v = sink; v != source; v = parent[v]) { int u = parent[v]; pathFlow = Math.min(pathFlow, capacity[u][v] - flow[u][v]); } for (int v = sink; v != source; v = parent[v]) { int u = parent[v]; flow[u][v] += pathFlow; flow[v][u] -= pathFlow; } maxFlow += pathFlow; } return maxFlow; }12:T4f7,public int EdmondsKarp(int[][] capacity, int source, int sink) { int n = capacity.Length; var flow = new int[n][]; for (int i = 0; i < n; i++) flow[i] = new int[n]; var parent = new int[n]; bool Bfs() { Array.Fill(parent, -1); var queue = new Queue(); queue.Enqueue(source); parent[source] = source; while (queue.Count > 0) { int u = queue.Dequeue(); for (int v = 0; v < n; v++) { if (parent[v] == -1 && capacity[u][v] - flow[u][v] > 0) { parent[v] = u; if (v == sink) return true; queue.Enqueue(v); } } } return false; } int maxFlow = 0; while (Bfs()) { int pathFlow = int.MaxValue; for (int v = sink; v != source; v = parent[v]) { int u = parent[v]; pathFlow = Math.Min(pathFlow, capacity[u][v] - flow[u][v]); } for (int v = sink; v != source; v = parent[v]) { int u = parent[v]; flow[u][v] += pathFlow; flow[v][u] -= pathFlow; } maxFlow += pathFlow; } return maxFlow; }13:T445,#include int bfs_ek(int n, int **cap, int **flow, int s, int t, int *parent) { int queue[n]; int head = 0, tail = 0; for (int i = 0; i < n; i++) parent[i] = -1; parent[s] = s; queue[tail++] = s; while (head < tail) { int u = queue[head++]; for (int v = 0; v < n; v++) { if (parent[v] == -1 && cap[u][v] - flow[u][v] > 0) { parent[v] = u; if (v == t) return 1; queue[tail++] = v; } } } return 0; } int edmonds_karp(int n, int *

Edmonds-Karp