Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<iostream>
- #include<fstream>
- #include<cmath>
- using namespace std;
- int viz[100],a[100],b[100],n,m,x[100];
- void citire()
- {
- ifstream f("euleriann");
- f>>n>>m;
- int i,j,nr=1;
- while(f>>i>>j)
- {a[nr]=i;b[nr]=j;
- nr++;}
- }
- void parcurgere_df(int x)
- {
- int i;viz[x]=1;
- for(i=1;i<=n;i++)
- if(a[x]==1&&viz[i]!=1)
- parcurgere_df(i);}
- int conex()
- {
- parcurgere_df(1);
- for(int i=1;i<=n;i++)
- if(viz[i]==0)
- return 0;
- return 1;
- }
- int pare()
- {
- for(int i=1;i<=n;i++)
- {
- int d=0;
- for(int j=1;j<=m;j++)
- if(a[j]==i||b[j]==i)
- d++;
- if(d%2==1||d==0)
- return 0;
- }
- return 1;
- }
- int sol(int k)
- {
- int nf;
- if(k!=m)return 0;
- else{if(x[k]>0)
- nf=b[x[k]];
- else nf=a[-x[k]];
- }
- return(nf==a[x[1]]);
- }
- int cond(int k)
- {
- int i,nf;
- for(i=1;i<k;i++)
- if(abs(x[i])==abs(x[i]))
- return 0;
- if(x[k-1]>0)
- nf=b[x[k-1]];
- else nf=a[x[k-1]];
- if(nf==a[x[k]])
- return 1;
- else if(nf==b[x[k]])
- return -1;
- else return 0;
- }
- void afisare()
- {
- int i;
- cout<<a[x[1]]<<" ";
- for(i=1;i<=m;i++)
- if(x[i]>0)
- cout<<b[x[i]]<<" ";
- else cout<<a[x[i]]<<" ";
- }
- void back()
- {
- int ok,k,i;
- k=2;
- x[1]=1;
- while(k>1)
- {
- ok=0;
- while(ok==0&&abs(x[k])<m)
- {
- x[k]=abs(x[k])+1;
- ok=cond(k);
- if(ok==-1)
- x[k]=-x[k];}
- if(ok==0)x[k]--;
- else if(sol(k)==1)
- afisare();
- else{k++;
- x[k]=1;
- }
- }
- }
- int main()
- {
- citire();
- if(conex()==1&&pare()==1)
- back();
- else cout<<"graful nu este eulerian";
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement