Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- //Sa se afiseze toate lanturile elementare intre oricare doua varfuri grafurilor distincte
- #include <iostream.h>
- #include <fstream.h>
- ifstream f("citire.in");
- int a[100][100], i, j, n, p, q, sol, x[100], k;
- void citire()
- {
- f>>n;
- for(i=1; i<=n; i++)
- for(j=1; j<=n; j++)
- f>>a[i][j];
- }
- 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;
- return 1;
- }
- void afis(int k)
- {
- for(int i=1; i<=k; i++)
- cout<<x[i]<<" ";
- cout<<'\n';
- sol++;
- }
- void back(int j)
- {
- int k=2; x[k]=0;
- do
- {
- while(x[k]<n)
- {
- x[k]++;
- if(cont(k))
- if(x[k]==j)
- afis(k);
- else
- {
- k++;
- x[k]=0;
- }
- }
- k--;
- }while(k>1);
- }
- int main()
- {
- citire();
- for(int i=1; i<=n; i++)
- {
- cout<<"Lanturile care pornesc din "<<i<<'\n';
- int j;for(j=i+1; j<=n; j++){x[1]=i;
- back(j);}
- }
- cout<<"Avem "<<sol<<" solutii.";
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement