Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<iostream>
- #include<fstream>
- using namespace std;
- int viz[100],n,m,a[100][100],x[100],x1,k;
- void citire()
- {ifstream f("citire.in");
- f>>n>>m;
- for(int i=1;i<=n;i++)
- for(int j=1;j<=n;j++)
- f>>a[i][j];
- f>>x1;
- }
- void parcurgere_DF(int x1)
- {int i;
- viz[x1]=1;
- for(i=1;i<=n;i++)
- if(a[i][x1]==1 && viz[i]!=1)
- parcurgere_DF(i);
- }
- int cont(int k)
- {if(k>1 && a[x[k-1]][x[k]]==0)
- return 0;
- for(int i=1;i<=k-1;i++)
- if(x[k]==x[i])
- return 0;
- return 1;
- }
- int sol(int k)
- {if(k==n && a[x[k]][x[1]])
- return 1;
- else return 0;
- }
- void afisare()
- {cout<<"un ciclu este "<<endl;
- for(int i=1;i<=n;i++)
- cout<<x[i]<<" ";
- cout<<x[1];
- }
- void back()
- {k=2;
- x[1]=1;
- while(k>1)
- {int gasit=0;
- while(gasit==0 && x[k]<n)
- {x[k]++;
- if(cont(k)==1)
- gasit=1;
- }
- if(gasit==0)
- k--;
- else if(sol(k)==1)
- afisare();
- else {k++;
- x[k]=1;}
- }
- }
- int main()
- {int ok=1,i;
- citire();
- parcurgere_DF(1);
- for( i=1;i<=n;i++)
- if(viz[i]==0)
- { ok=0;
- i=n+1;}
- if(ok==0)
- cout<<"graful nu este hamiltonian";
- else {cout<<" graful este hamiltonian";
- cout<<endl;
- back();}
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement