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