Advertisement
Guest User

Untitled

a guest
Dec 11th, 2017
56
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.01 KB | None | 0 0
  1. #include <iostream>
  2. #include <iomanip>
  3. using namespace std;
  4. int n,m,i,j,a,A[101][101],eul[101],sf;
  5. void unCiclu(int indice)
  6. {
  7. int k;
  8. for(k=1;k<=n;k++)
  9. {
  10. if(A[eul[indice]][k]==1)
  11. {
  12. A[eul[indice]][k]=0;
  13. A[k][eul[indice]]=0;
  14. sf++;
  15. for(int i=sf;i>indice;i--)
  16. eul[i]=eul[i-1];
  17. eul[++indice]=k;
  18. unCiclu(indice);
  19. }
  20. }
  21. }
  22. int main()
  23. {
  24. cout<<"n="; cin>>n;
  25. cout<<"m="; cin>>m;
  26. for(a=1;a<=m;a++)
  27. {
  28. cin>>i>>j;
  29. A[i][j]=1;
  30. A[j][i]=1;
  31. cout<<endl;
  32. }
  33. cout<<"MATRICEA DE ADIACENTA ESTE: \n";
  34. for(i=1;i<=n;i++)
  35. {
  36. for(j=1;j<=n;j++)
  37. cout<<setw(n)<<A[i][j];
  38. cout<<endl;
  39. }
  40. eul[1]=1;
  41. sf=1;
  42. for(i=1;i<=eul[i];i++)
  43. unCiclu(i);
  44. cout<<endl;
  45. for(i=1;i<=sf;i++)
  46. cout<<eul[i]<<" ";
  47. return 0;
  48. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement