Advertisement
Aniebunny

succesori, predecesori

Oct 21st, 2019
119
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.07 KB | None | 0 0
  1. #include <iostream>
  2. #include <fstream>
  3. using namespace std;
  4. fstream f("matrice.txt");
  5. int a[20][20],n,suc[100],prec[100],x,y,z;
  6.  
  7. void citire()
  8. {f>>n;
  9. for(int i=1;i<=n;i++)
  10. {f>>x>>y;
  11. a[x][y]=1;
  12.  
  13. }
  14.  
  15. }
  16.  
  17.  
  18. void succ(int nod)
  19. {suc[nod]=x;
  20. for(int k=1;k<=n;k++)
  21. if(a[nod][k]==1&&suc[k]==0)
  22. succ(k);}
  23.  
  24. void predec(int nod)
  25. {prec[nod]=x;
  26. for(int k=1;k<=n;k++)
  27. if(a[k][nod]==1&&prec[k]==0)
  28. predec(k);
  29. }
  30.  
  31. void afisare()
  32. {for(int i=1;i<=n;i++)
  33. {for(int j=1;j<=n;j++)
  34. cout<<a[i][j]<<" ";
  35. cout<<endl;
  36.  
  37. }
  38.  
  39. }
  40.  
  41.  
  42. int main()
  43. {citire();
  44. afisare();
  45.  
  46. cin>>x;
  47. succ(x);
  48. cout<<endl<<"succesorii lui "<<x<<endl;
  49. for(int i=1;i<=n;i++)
  50. {
  51. if(suc[i]!=0)
  52. cout<<i<<" ";}
  53. cout<<endl;
  54.  
  55. predec(x);
  56. cout<<endl<<"Predecesorii lui "<<x<<endl;
  57. for(int i=1;i<=n;i++)
  58. {if(prec[i]!=0)
  59. cout<<i<<" ";}
  60. cout<<endl;
  61.  
  62. cout<<endl<<"componenta tare conexa in care se gaseste "<<x<<" este"<<endl;
  63. for(int i=1;i<=n;i++)
  64. if(prec[i]==suc[i]&&suc[i]!=0)
  65. cout<<i<<" ";
  66.  
  67. cout<<endl;
  68.  
  69. return 0;
  70. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement