poj_1041 John's trip - c++编程基础

是否连通?
??????????? e[z].end=y;?
??????????? //计算边数和点数?
??????????? if(es ??????????????? es=z;?
??????????? if(v ??????????????? v=x;?
??????????? if(v ??????????????? v=y;?
??????????? //记录出度和入度，用来判断欧拉路?
??????????? indegree[x]++;?
??????????? outdegree[y]++;?
??????? }?
?
??????? //判断是否是欧拉回路?
??????? for(i=1;i<=v;i++)?
??????? {?
??????????? for(j=1;j<=v;j++)?
??????????? {?
??????????????? if(g[i][j]==1 && (outdegree[j]+indegree[j])%2!=0)?
??????????????? {?

??????????????????? printf("Round trip does not exist.\n");?
??????????????????? break;?
??????????????? }?
??????????? }?
??????????? if(j<=v)?
??????????????? break;?
??????? }?
??????? if(i<=v)?
??????????? continue;?
??????? euler(start);?
??????? for(i=es-1;i>=1;i--)?
??????? {?
??????????? printf("%d ",temp[i]);?
??????? }?
??????? printf("%d\n",temp[0]);?
??? }?
?
??? return 0;?
}?
作者：CSDN515

poj_1041 John's trip(二)