Noip图论整理.doc

图论程序整理 Edmonds-Karp var ans,i,j,k,s,t,tot,m,n,a,b,c:longint; u,v,w,next,other:array[0..200] of longint; point,d,q,pre:array[0..200] of longint; function min(a,b:longint):longint; begin if ab then exit(b) else exit(a); end; procedure add_edge(a,b,c:longint); begin inc(k);u[k]:=a;v[k]:=b;w[k]:=c; next[k]:=point[a];point[a]:=k;other[k]:=k+1; inc(k);u[k]:=b;v[k]:=a;w[k]:=0; next[k]:=point[b];point[b]:=k;other[k]:=k-1; end; function found:boolean; var j,head,tail:longint; begin head:=0;tail:=1;q[1]:=s; fillchar(d,sizeof(d),127); d[s]:=0; while headtail do begin inc(head); j:=point[q[head]]; while j0 do begin if (w[j]0) and (d[u[j]]+1d[v[j]]) then begin d[v[j]]:=d[u[j]]+1; pre[v[j]]:=j; inc(tail);q[tail]:=v[j]; if v[j]=t then exit(true); end; j:=next[j]; end; end; exit(false); end; procedure augment; var p,flow:longint; begin p:=t; flow:=maxlongint; while ps do begin flow:=min(flow,w[pre[p]]); p:=u[pre[p]]; end; ans:=ans+flow; p:=t; while ps do begin dec(w[pre[p]],flow); inc(w[other[pre[p]]],flow); p:=u[pre[p]]; end; end; begin readln(m,n); s:=1;t:=n;tot:=n; fillchar(point,sizeof(point),0); k:=0; for i:=1 to m do begin read(a,b,c); add_edge(a,b,c); end; ans:=0; while found do augment; writeln(ans); end. Dinic var map:array[0..201,0..201]of longint; dis,q:array[0..201]of longint; visit:array[0..201]of boolean; n,m,ans:longint; procedure init; var u,v,s,i:longint; begin readln(m,n); for i:=1 to m do begin readln(u,v,s); inc(map[u,v],s); end; end; function can_build:boolean; var sum,i,len,head,u,v:longint; begin can_build:=false; fillchar(visit,sizeof(visit),false); q[0]:=n; visit[n]:=true; dis[n]:=0; len:=0; head:=0; while head=len do begin u:=q[head]; for v:=1 to n do if (not visit[v])and(map[v][u]0) then begin inc(len); q[len]:=v; visit[v]:=true;