Created
February 16, 2017 18:57
-
-
Save ManiruzzamanAkash/a9465cb33d09eabc6903133f470c382b to your computer and use it in GitHub Desktop.
BFS code in C language
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
/** | |
BFS code in C language | |
@author: Maniruzzaman Akash<manirujjamanakash@gmail.com> | |
**/ | |
#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"); | |
} |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment