hdu3549Flow Problem（最大流 模板题）

题目链接：

http://acm.hdu.edu.cn/showproblem.php?pid=3549

网络流最大流模板题。

#include<stdio.h>
#include<string.h>
#include<algorithm>
#define rep(i,a,b) for(int i=a;i<=b;i++)
#define inf 0x3f3f3f3f
#define MM 10005
using namespace std;
//struct Dicnic{
    struct Edge{
        int from,to,cap,flow,next;
        Edge(){}
        Edge(int from,int to,int cap,int flow,int next){
            this->from=from;
            this->to=to;
            this->cap=cap;
            this->flow=flow;
            this->next=next;

        }
    }ed[MM];

    int n,m,s,t,lnum,head,tail;
    int cur[MM],start[MM],que[MM*10],dis[MM];

    void init(){
        lnum=0;
      //  printf("%d %d\n",s,t);
        rep(i,s,t) start[i]=-1;
    }

    void add(int x,int y,int c){
        ed[lnum]=Edge(x,y,c,0,start[x]);
        start[x]=lnum++;

        ed[lnum]=Edge(y,x,0,0,start[y]);
        start[y]=lnum++;
    }

    bool bfs(){
        rep(i,s,t) dis[i]=-1;
        head=tail=0;
        dis[s]=0;
        que[tail++]=s;
        while(head<tail){
            int x=que[head++];
            for(int i=start[x];~i;i=ed[i].next){
                Edge& e=ed[i];
                if(e.cap>e.flow&&dis[e.to]==-1){
                    dis[e.to]=dis[x]+1;
                    que[tail++]=e.to;
                }
            }
        }
        return dis[t]!=-1;
    }

    int dfs(int x,int a){
        if(x==t||a==0) return a;
        int flow=0,f;
        for(int& i=cur[x];~i;i=ed[i].next){
            Edge& e=ed[i];
            if(dis[e.to]==dis[x]+1&&(f=dfs(e.to,min(a,e.cap-e.flow)))>0){
                e.flow+=f;
                ed[i^1].flow-=f;
                flow+=f;
                a-=f;
                if(!a) break;
            }
        }
        return flow;
    }

    int Maxflow(){
        int flow=0;
        memset(cur,0,sizeof(cur));
        while(bfs()){
        
            rep(i,s,t) cur[i]=start[i];
            flow+=dfs(s,inf);
        }
        return flow;
    }

//}dic;



/*
struct MCMF{
    struct Edge{
        int from,to,cap,flow,cost,next;
        Edge(){}
        Edge(int from,int to,int cap,int flow,int cost,int next){
            this->from=from;
            this->to=to;
            this->cap=cap;
            this->flow=flow;
            this->cost=cost;
            this->next=next;
        }
    }ed[666666];
    int n,m,s,t,head,tail,lnum;
    int vis[MM],dis[MM],pre[MM];//pre 上一条弧
    int cag[MM],que[MM*3],start[MM];//cag 可改进量

    void init(){
        lnum=0;
        rep(i,s,t) start[i]=-1;
    }

    void add(int x,int y,int v,int c){
        ed[lnum]=Edge(x,y,v,0,c,start[x]);
        start[x]=lnum++;
        ed[lnum]=Edge(y,x,0,0,-c,start[y]);
        start[y]=lnum++;
    }

    bool spfa(int& flow,int& cost){
        rep(i,s,t) dis[i]=inf,vis[i]=0;
        head=tail=0;
        dis[s]=0;vis[s]=1;pre[s]=0;cag[s]=inf;
        que[tail++]=s;
        while(head<tail){
            int x=que[head++];
            vis[x]=0;
            for(int i=start[x];~i;i=ed[i].next){
                Edge& e=ed[i];
                if(e.cap>e.flow&&dis[e.to]>dis[x]+e.cost){
                    dis[e.to]=dis[x]+e.cost;
                    pre[e.to]=i;
                    cag[e.to]=min(cag[x],e.cap-e.flow);
                    if(!vis[e.to]){
                        que[tail++]=e.to;
                        vis[e.to]=1;
                    }
                }
            }
        }
        if(dis[t]==inf) return false;
        flow+=cag[t];
        cost+=dis[t]*cag[t];
        int x=t;
        while(x!=s){
            ed[pre[x]].flow+=cag[t];
            ed[pre[x]^1].flow-=cag[t];
            x=ed[pre[x]].from;
        }
        return true;
    }

    int Mincost(){
        int flow=0,cost=0;
        while((spfa(flow,cost)));
        return cost;
    }

}mcmf;
*/
int main()
{
    int T,i,j,k,a,b,c,icase=0;
    scanf("%d",&T);
    while(T--)
    {
        icase++;
        scanf("%d%d",&n,&m);
        s=1;t=n;
        init();
        
        while(m--)
        {
            scanf("%d%d%d",&a,&b,&c);
            add(a,b,c);
        }
        printf("Case %d: ",icase);
    
        printf("%d\n",    Maxflow());
    }
}