Scribd
Upload
13 views3 pages

Bfs and Dfs

Uploaded by

gauravkhandelwal3547
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
13 views3 pages

Bfs and Dfs

Uploaded by

gauravkhandelwal3547
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

#include <stdio.

h>

#include <stdlib.h>

int adjm[20][20],q[20],visited[20],reach[10],n,i,j,f=-1,r= -1,count=0;

void bfs(int v)

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

if(adjm[v][i] && !visited[i])

q[++r]=i;

if(f<=r)

visited[q[f]]=1;

bfs(q[f++]);

void dfs(int v)

int i;

reach[v]=1;

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

if(adjm[v][i] && !reach[i])

printf("\n %d->%d",v,i);

count++;

dfs(i);

void main()

{
int v, choice;

printf("\n Enter the number of vertices:"); scanf("%d",&n);

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

q[i]=0;

visited[i]=0;

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

reach[i]=0;

printf("\n Enter graph data in matrix form:\n");

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

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

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

printf("1.BFS\n 2.DFS\n 3.Exit\n");

scanf("%d",&choice);

switch(choice)

{ case 1: printf("\n Enter the starting vertex:");

scanf("%d",&v);

bfs(v);

if((v<1)||(v>n))

{ printf("\n Bfs is not possible");

else

{ printf("\n The nodes which are reachable from %d:\n",v);

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

if(visited[i])

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

break;

case 2: dfs(1);

if(count==n-1)
printf("\n Graph is connected");

else

printf("\n Graph is not connected");

break;

case 3: exit(0);

You might also like