Joined
Last Seen
0 Reputation Points
Unknown Quality Score
No one has voted on any posts yet. Votes from other community members are used to determine a member's reputation amongst their peers.
0 Endorsements
Ranked #72.7K
|
edges.txt is used.it is the input adjacency list. 1 3 1 5 2 3 2 6 4 5 5 6 #include<stdio.h> #include<stdlib.h> #include<conio.h> int **adjL; int v,*arr; void dfs(int **adjL) { int j,i=0,temp,dfslabel=1,s=0,k=0,top=0; int stack[v]; int *flag; flag=(int*)calloc(v+1,sizeof(int)); for(i=0;i<=v;i++) flag[i]=0; stack[++top]=1; flag[1]=3; stack[top]=1; while(1) { if(i==arr[stack[top]-1]) { printf("examination of %d … 
|