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], i, j, n, p, x[100], k;
- void citire();
- int hemiltonian();
- void afis();
- int cont(int k);
- void back();
- int main()
- {
- citire();
- if(hamiltonian())
- { cout<<"Este hamiltonian.";
- back();
- }
- else cout<<"Nu este!";
- return 0;
- }
- int hamiltonian()
- {
- // test
- }
- void citire()
- {
- ifstream f("c.in");
- f>>n;
- for(int i=1; i<=n; i++)
- for(int j=1; j<=n; j++)
- f>>a[i][j];
- f.close();
- }
- int cont(int k)
- {
- for(int i=1;i<k;i++)
- if(x[i]==x[k])
- return 0;
- if(k>1)
- if(a[x[k]][x[k-1]]==0)
- return 0;
- if(k==n)
- if(a[x[n]][x[1]]==0)
- return 0;
- return 1;
- }
- void afis()
- {
- for(int i=1;i<=n;i++)
- cout<<x[i]<<' ';
- cout<<x[1];
- cout<<endl;
- }
- void back()
- {
- k=1;x[0]=0;
- x[k]=x[k-1];
- do
- {
- while(x[k]<n)
- {
- x[k]++;
- if(cont(k))
- if(k==n)
- afis();
- else
- {
- k++;
- x[k]=0;
- }
- }
- k--;
- }
- while(k);
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement