Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <stdio.h>
- #include <stdlib.h>
- int counter=1,source,N,M,time,visited[1000],G[1000][1000];
- void DFS(int i)
- {
- int j;
- visited[i]=1;
- for(j=0;j<N;j++)
- {
- if(G[i][j]==1&&visited[j]==0)
- DFS(j);
- else if(G[i][j]==1&&visited[j]==1)
- counter++;
- }
- }
- int main()
- {
- int i,j,v1,v2;
- scanf("%d %d",&N,&M);
- for(i=0;i<N;i++)
- {
- for(j=0;j<N;j++)
- G[i][j]=0;
- }
- for(i=0;i<M;i++)
- {
- scanf("%d %d",&v1,&v2);
- G[v1-1][v2-1]=1;
- }
- for(source=1;source<=N;source++)
- DFS(source-1);
- printf("%d",counter);
- return(0);
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement