Advertisement
Guest User

Untitled

a guest
Dec 17th, 2018
81
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.37 KB | None | 0 0
  1. #include <iostream>
  2. #include <fstream>
  3.  
  4. using namespace std;
  5. ifstream fin("fisier.in");
  6. ofstream fout("fisier.out");
  7. int a[101][101],n,i,j,v[101],coada[101],ic,sc;
  8.  
  9. void citire()
  10. {
  11. int x,y;
  12. fin>>n;
  13. while(fin>>x>>y)
  14. a[x][y]=a[y][x]=1;
  15. }
  16.  
  17.  
  18.  
  19. void DF(int nod)
  20. {
  21. int k;
  22. fout<<nod<<" ";
  23. v[nod]=1;
  24. for(k=1;k<=n;k++)
  25. if(a[nod][k]==1 && !v[k])
  26. DF(k);
  27. }
  28.  
  29. void ComponenteConexe()
  30. {
  31. int nrcc=0;
  32. for(i=1;i<=n;i++)
  33. if(!v[i])
  34. {
  35. nrcc++;
  36. fout<<"comp con"<<nrcc<<" ";
  37. DF(i);
  38. }
  39. }
  40.  
  41. void init()
  42. {
  43. for(i=1;i<=n;i++)
  44. v[i]=0;
  45. }
  46.  
  47. void DFciclu(int nod)
  48. {
  49. int k,gasit;
  50. v[nod]=1;
  51. for(k=1;k<=n;k++)
  52. if(a[nod][k]==1)
  53. {
  54. a[k][nod]==0;
  55. if(!v[k])
  56. DFciclu(k);
  57. else
  58. gasit=1;
  59. }
  60. }
  61.  
  62. void BF(int nod)
  63. {
  64. coada[ic]=nod;
  65. v[nod]=1;
  66. while(ic<=sc)
  67. {
  68. i=1;
  69. while(i<=n)
  70. {
  71. if(a[coada[ic]][i]==1 && !v[i])
  72. {
  73. sc++;
  74. coada[sc]=i;
  75. v[i]=1;
  76. }
  77. i++;
  78. }
  79. fout<<coada[ic]<<" ";
  80. ic++;
  81. }
  82. }
  83.  
  84. int main()
  85. {
  86. citire();
  87. //DF(3);
  88. //ComponenteConexe();
  89. //init();
  90. // DFciclu(3);
  91. BF(6);
  92.  
  93. return 0;
  94. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement