DFS

Adithya

Program to achieve DFS operation...

#include<stdio.h>

#include<conio.h>

int adj[10][10],visit[10]={0},n=0,count=0;

main()

{

void dfs(int node);

int s,i,j;

clrscr();

printf("\nEnter the no of nodes : ");scanf("%d",&n);

printf("\nEnter the adjacency matrix \n");

for(i=1;i<=n;i++)

for(j=1;j<=n;j++)

scanf("%d",&adj[i][j]);

printf("\nEnter the starting node : "); scanf("%d",&s);

printf("\n\n");

printf(" ~~ TREE ~~ \n\n");

dfs(s);

if(count==n)

printf("\n\n\nResult : Connected graph..!!");

else

printf("\n\n\nResult : Not connected..!");

getch();

return 0;

}

void dfs(int node)

{

int i;

count++;

visit[node]=1;

printf("%d\t",node);

for(i=1;i<=n;i++)

if(adj[node][i]==1 && visit[i]==0)

dfs(i);

}

Category: C Program

Lets 'C'