Scribd
Upload
23 views2 pages

DAA Lab Assignment - 4: Breadth-First Search (BFS)

Uploaded by

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

DAA Lab Assignment - 4: Breadth-First Search (BFS)

Uploaded by

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

DAA Lab Assignment – 4

.Breadth-first search (BFS)


#include <stdio.h>

int a[20][20], q[20], visited[20], n, i, j, f = 0, r = -1;


void bfs(int v)
{
for (i = 1; i <= n; i++)
if (a[v][i] && !visited[i])
q[++r] = i;
if (f <= r)
{
visited[q[f]] = 1;
bfs(q[f++]);
}
}
void main()
{
int v;

printf("\n Enter the number of vertices:");


scanf("%d", &n);
for (i = 1; i <= n; i++)
{
q[i] = 0;
visited[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", &a[i][j]);
printf("\n Enter the starting vertex:");
scanf("%d", &v);
bfs(v);
printf("\n The node which are reachable are:\n");
for (i = 1; i <= n; i++)
if (visited[i])
printf("%d\t", i);
else
printf("\n Bfs is not possible");

OUTPUT

You might also like