diff options
| author | MZuenni <michi.zuendorf@gmail.com> | 2024-06-28 13:47:18 +0200 |
|---|---|---|
| committer | MZuenni <michi.zuendorf@gmail.com> | 2024-06-28 13:47:18 +0200 |
| commit | 65d2ac37862ce9d1de208a05099c281863e66256 (patch) | |
| tree | d1fe1ece8790e8e8b2a8bcd3895f82477b3a0e2b /graph/minCostMaxFlow.cpp | |
| parent | a3c9198048cf465a3c01827b3667edfc99d8031c (diff) | |
| parent | 366ff0a4ba0c94f5cdc2cbd4e2c991ad0b544522 (diff) | |
merge
Diffstat (limited to 'graph/minCostMaxFlow.cpp')
| -rw-r--r-- | graph/minCostMaxFlow.cpp | 3 |
1 files changed, 0 insertions, 3 deletions
diff --git a/graph/minCostMaxFlow.cpp b/graph/minCostMaxFlow.cpp index 3526b17..14a222c 100644 --- a/graph/minCostMaxFlow.cpp +++ b/graph/minCostMaxFlow.cpp @@ -8,7 +8,6 @@ struct MinCostFlow { vector<vector<int>> adj; vector<int> pref, con; vector<ll> dist; - const int s, t; ll maxflow, mincost; @@ -27,12 +26,10 @@ struct MinCostFlow { dist.assign(sz(adj), INF); vector<bool> inqueue(sz(adj)); queue<int> queue; - dist[s] = 0; queue.push(s); pref[s] = s; inqueue[s] = true; - while (!queue.empty()) { int cur = queue.front(); queue.pop(); inqueue[cur] = false; |