poj a b java_POJ 3164 最小树形图算法

//3164.cpp : Defines the entry point for the console application.//#include#includeusingnamespacestd;

typedefstruct_Point

{doublex;doubley;doubledistanceTo(conststruct_Point&r)

{returnsqrt((x-r.x)*(x-r.x)+(y-r.y)*(y-r.y));

}

}Point;constintMAX_V=100;constintMAX_E=10000;constdoubleNO_EDGE=1.7976931348623158e+308;

Point vertexes[MAX_V]={0};intparents[MAX_V]={0};intranks[MAX_V]={0};doubleG[MAX_V][MAX_V]={0};boolvisited[MAX_V]={0};booldeleted[MAX_V]={0};intprev[MAX_V]={0};intnVertex=0;intnEdge=0;intu_find(inta)

{if(parents[a]==a)returna;

parents[a]=u_find(parents[a]);returnparents[a];

}voidu_union(inta,intb)

{intpa=u_find(a);intpb=u_find(b);if(ranks[pa]==ranks[pb])

{

ranks[pa]++;

parents[pb]=pa;

}elseif(ranks[pa]

{

parents[pa]=pb;

}else{

parents[pb]=pa;

}

}voidDFS(intv,int&c)

{

visited[v]=true;for(inti=1;i

{if(!visited[i]&&G[v][i]

{

c+=1;

DFS(i,c);

}

}

}voiddoCycle(ints,intt,double&cost)

{

memset(visited,0,sizeof(bool)*nVertex);inti=s;do{

visited[i]=true;

cost+=G[prev[i]-1][i];//cout<

}while(i!=s);do{for(intk=0;k

{if(!deleted[k]&&!visited[k])

{if(G[k][i]

{if(G[k][i]-G[prev[i]-1][i]

{

G[k][s]=G[k][i]-G[prev[i]-1][i];//cout<

}if(G[i][k]

{if(G[i][k]

{

G[s][k]=G[i][k];//cout<

}

}

}if(i!=s)

{

deleted[i]=true;//cout<

i=prev[i]-1;

}while(i!=s);

}intmain(void)

{while(cin>>nVertex>>nEdge)

{ints,t;intnv=0;boolcycle=0;doublecost=0;

memset(vertexes,0,sizeof(vertexes));

memset(visited,0,sizeof(visited) );

memset(deleted,0,sizeof(deleted));

memset(G,0,sizeof(G));

memset(prev,0,sizeof(prev));

memset(ranks,0,sizeof(ranks));

memset(parents,0,sizeof(parents));for(inti=0;i

{

cin>>vertexes[i].x>>vertexes[i].y;

parents[i]=i;for(intj=0;j

{

G[i][j]=NO_EDGE;

}

}for(inti=0;i

{

cin>>s>>t;if(t==1||s==t)continue;

G[s-1][t-1]=vertexes[s-1].distanceTo(vertexes[t-1]);

}

DFS(0,nv);if(nv

{

cout<

}do{

cycle=false;for(inti=0;i

memset(ranks,0,sizeof(bool)*nVertex);for(inti=1; i

{if(!deleted[k]&&minimum>G[k][i])

{

prev[i]=k+1;

minimum=G[k][i];

}

}if(minimum==NO_EDGE)

{throw1;

}if(u_find(prev[i]-1)==u_find(i)) {

doCycle(prev[i]-1,i, cost);

cycle=true;break;

}else{

u_union(i,prev[i]-1);

}

}

}while(cycle);for(inti=1; i

{

cost+=G[prev[i]-1][i];//cout<

}

printf("%.2f\n",cost);

}

}