Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <fstream>
- using namespace std;
- ifstream in("date.in");
- bool viz[100];
- void citire(int a[100][100],int &n,int &m)
- {
- in>>n>>m;
- for(int i=1;i<=m;i++)
- {
- int x,y;
- in>>x>>y;
- a[x][y]=1;
- }
- for(int i=1;i<=n;i++)
- {
- for(int j=1;j<=n;j++)
- cout<<a[i][j]<<" ";
- cout<<endl;
- }
- }
- void dfs(int nod,int a[100][100],int n)
- {
- viz[nod]=true;
- for(int i=1;i<=n;i++)
- if(a[nod][i]==1 && !viz[i])
- {
- dfs(i,a,n);
- }
- }
- int rezolvare(int a[100][100],int n)
- {
- int ok=1;
- for(int i=1;i<=n;i++)
- {
- for(int j=1;j<=n;j++)
- viz[j]=0;
- dfs(i,a,n);
- for(int k=1;k<=n;k++)
- if(k!=i && !viz[k])
- return 0;
- }
- return 1;
- }
- int main()
- {
- int a[100][100],n,m;
- citire(a,n,m);
- if(rezolvare(a,n)==1)
- cout<<"este tare conex";
- else
- cout<<"nu este tare conex";
- //dfs(5,a,n);
- // for(int i=1;i<=n;i++)
- // cout<<viz[i]<<" ";
- 7 10
- 1 2
- 1 4
- 2 3
- 3 1
- 4 3
- 4 5
- 5 4
- 5 7
- 6 5
- 7 6
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement