Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<bits/stdc++.h>
- using namespace std;
- bool vis[10];
- int n,graph[10][10];
- void dfs(int pos)
- {
- int i;
- if(vis[pos]==1)
- return;
- else
- {
- vis[pos]=1;
- for(i=0;i<n;i++)
- {
- if(graph[pos][i]==1)
- dfs(i);
- }
- }
- }
- int main()
- {
- cin>>n;
- int i,j,k;
- for(i=0;i<n;i++)
- {
- for(j=0;j<n;j++)
- {
- cin>>graph[i][j];
- }
- }
- int cnt=0,mx=0;
- for(k=0;k<n;k++)
- {
- memset(vis,0,sizeof(vis));
- vis[k]=-1;
- cnt=0;
- for(j=0;j<n;j++)
- {
- if(vis[j]==0)
- {
- cnt++;
- dfs(j);
- }
- }
- if(cnt>1)
- {
- if(mx<cnt)
- {
- mx=cnt;
- cout<<cnt<<endl;
- }
- }
- cout<<mx<<endl;
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement