C++语言 VC6.0编译环境 /*标号法求最大流代码*/ #include using namespace std; int lt[21][2]; int g[21][21][2]; int n,s,t,i,j,m,x,a,ma; bool f; int main(){ freopen("1.txt","r",stdin); int d; memset(lt,0,sizeof(lt)); memset(g,0,si zeof(g)); cin>>n; for(i=1;i<=
类似标号法，本质为贪心算法。 var a:array[1..maxn,1..maxn] of integer; b,pre:array[1..maxn] of integer; {pre[i]指最短路径上I的前驱结点} mark:array[1..maxn] of boolean; procedure dijkstra(v0:integer); begin fillchar(mark,sizeof(mark),false); for i:=1 to n do b egin d[i]:=a[v0
