最大流-Dinic算法（矩阵）

#include <stdio.h>
#include <algorithm>
#include <string.h>
#include <queue>
#include <iostream>

using namespace std;
int w[205][205],deep[205];
int n, m, ans= 0;
queue<int>q;
bool DinicBfs()
{
    while(!q.empty())
        q.pop();
    memset(deep,0,sizeof(deep));
    q.push(1);
    deep[1] = 1;
    while(!q.empty())
    {
        int root = q.front();
        q.pop();
        for(int i = 1 ; i <= n ; i ++)
        {
            if(w[root][i] > 0 && !deep[i]) {
                deep[i] = deep[root] + 1;
                q.push(i);
            }
        }
    }
    return deep[n] != 0;

}
int DinicDfs(int root, int flow)
{
    if(root == n)
        return flow;
    int newflow;
    for(int i = 1 ; i <= n ; i ++)
    {
        if(w[root][i] > 0 && deep[root]+1 == deep[i] && (newflow = DinicDfs(i,min(flow,w[root][i]))))//newflow不能为0，为0代表当前分层网络中没有增广路，不到终点
        {
            w[root][i] -= newflow;
            w[i][root] += newflow;
            return newflow;
        }
    }
    return 0;
}
void Dinic()
{
    while(DinicBfs())
    {
        while(int add = DinicDfs(1,0x3f))
            ans += add;
    }
}
int main(void)
{
    while(scanf("%d %d",&m ,&n)!=EOF) {
        memset(w,0,sizeof(w));
        ans = 0;
        for (int i = 1; i <= m; i++) {
            int f, t, ww;
            scanf("%d %d %d", &f, &t, &ww);
            w[f][t] += ww;
        }
        Dinic();
        printf("%d\n", ans);
    }
}