非递归邻接表DINIC最大流模板

// 1.设置上限MAXN和MAXN 2.初始化数值src, des, nNode 3.init_adj() & ex_addEdge() 4.dinic()

const int MAXN=205,MAXM=MAXN*MAXN,INF = 0x3fffffff;

struct node {
int v, next,flw;
} e[MAXM];

int eid, p[MAXN], lv[MAXN],src, des, nNode;

#define init_adj() (eid = 0,memset(p, -1, sizeof (p)))

void ex_addEdge(int u, int v, int c1, int c2) {
    e[eid].v = v;
    e[eid].flw = c1;
    e[eid].next = p[u];
    p[u] = eid++;

    e[eid].v = u;
    e[eid].flw = c2;
    e[eid].next = p[v];
    p[v] = eid++;
}

int bfs() {
    static int que[MAXN];
    int i, u, v, c, cur, f = 0, r = 1;
    memset(lv, 0, sizeof (lv));
    lv[src] = 1, *que = src;
    while (f < r) {