-
Notifications
You must be signed in to change notification settings - Fork 0
/
t4a.c
69 lines (56 loc) · 781 Bytes
/
t4a.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
//BFS
#include<stdio.h>
int queue[20],front=-1,rear=-1;
int a[20][20],v[20]={0};
int n,i,j;
void insert(int x)
{
if(front==-1)
front++;
queue[++rear]=x;
}
int isempty()
{
if(rear==-1)
return 1;
else
return 0;
}
void delqueue()
{
printf("%d\t",queue[front]);
if(front==rear)
front=rear=-1;
else
front++;
}
void bfs(int x)
{
//printf("%d\t",x);
v[x]=1;
insert(x);
while(!isempty())
{
int y=queue[front];
for(i=1;i<=n;i++)
if(a[y][i]==1 && v[i]==0)
{
insert(i);
v[i]=1;
}
delqueue();
}
}
void main()
{
printf("\nEnter 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",&a[i][j]);
for(i=1;i<=n;i++)
if(v[i]==0)
bfs(i);
printf("\n");
}