最大流SAP模板（邻接矩阵）

来源：互联网发布：java局域网通信编辑：程序博客网时间：2024/04/29 03:59
#include <stdio.h>#include <math.h>#include <stdlib.h>  #include <ctype.h>  #include <algorithm>  #include <vector>  #include <string.h>  #include <queue>  #include <stack>  #include <set>  #include <map>  #include <string>  #include <sstream>  #include <malloc.h>using namespace std;//结点编号0开始const int MAXN = 1100;int maze[MAXN][MAXN];int gap[MAXN], dis[MAXN], pre[MAXN], cur[MAXN];int sap(int start,int end,int nodenum){    memset(cur, 0, sizeof(cur));    memset(dis, 0, sizeof(dis));    memset(gap, 0, sizeof(gap));    int u = pre[start] = start, maxflow, aug = -1;    gap[0] = nodenum;    while (dis[start] < nodenum)    {        loop:        for (int v = cur[u]; v < nodenum; v++)            if (maze[u][v] && dis[u] == dis[v] + 1)            {                if (aug == -1 || aug > maze[u][v])                    aug = maze[u][v];                pre[v] = u;                u = cur[u] = v;                if (v == end)                {                    maxflow += aug;                    for (u = pre[u]; v != start; v = u, u = pre[u])                    {                        maze[u][v] -= aug;                        maze[v][u] += aug;                    }                    aug = -1;                }            goto loop;            }        int mindis = nodenum - 1;        for (int v = 0; v < nodenum;v++)            if (maze[u][v] && mindis > dis[v])            {                cur[u] = v;                mindis = dis[v];            }        if ((--gap[dis[u]]) == 0) break;        gap[dis[u] = mindis + 1]++;        u = pre[u];    }    return maxflow;}int main(){    return 0;}
0 0