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