Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <fstream>
- using namespace std;
- int a[20][20], n, viz[100];
- ifstream f("mat.txt");
- void parcurgere(int x)
- {
- viz[x]=1;
- for(int i=1;i<=n;i++)
- if(a[i][x]==1&&viz[i]==0)
- parcurgere(i);
- }
- void citire()
- {
- f>>n;
- for(int i=1;i<=n;i++)
- for(int j=1;j<=n;j++)
- f>>a[i][j];
- }
- int conex()
- {
- parcurgere(1);
- for(int i=1;i<=n;i++)
- if(viz[i]==0)
- return 0;
- return 1;
- }
- int verificare()
- {int ct=0;
- for(int i=1;i<=n;i++)
- for(int j=1;j<=n;j++)
- if(a[i][j]==1)
- ct++;
- if(ct/2==n-1&&conex()!=0)
- return 1;
- }
- int main()
- {
- citire();
- if(verificare()==1)
- cout<<"Graful este un arbore";
- else
- cout<<"Graful nu este un arbore";
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement