随笔分类 -  欧拉回路

摘要：欧拉路径。代码：#include<iostream>#include<fstream>#include<vector>#include<algorithm>using namespace std;int n;char x[1001][22];struct e{ int data; int num; int vis;};int in[30],out[30],v[30];vector<e> edge[30],edge1[30];int cmp1(const void *a,const void*b){ char *s1=(char *)a 阅读全文

摘要：要判连通性，代码：#include<iostream>#include<fstream>#include<vector>using namespace std;int in[30];int out[30];int n;int v[30];vector<int> edge[27];void dfs(int s){ v[s]=1; for(int i=0;i<edge[s].size();i++) if(v[edge[s][i]]==0) dfs(edge[s][i]);}int ok(int s){ int i; memset(v,0,siz 阅读全文

摘要：简单欧拉回路。代码:#include<iostream>#include<fstream>#include<vector>using namespace std;struct e{ int data; int num;};vector<e> a[51];int v[51];int vis[2000];void solve(int s){ for(int i=0;i<a[s].size();i++) { if(vis[a[s][i].num]==0) { vis[a[s][i].num]=1; solve(a[s][i].data); cou 阅读全文