Untitled
unknown
plain_text
4 months ago
494 B
2
Indexable
#include<stdio.h> #include<stdlib.h> int n, a[10][10],i,j,source,s[10],choice,count void bfs(int n,int a[10][10],int source,int s[]) { int q[10],u; int front=1,rear=1; s[source]=1; q[rear]=source; while(front<=rear) { u=q[front]; front=front+1; for(i=1;i<=n;i++) if(a[u][i]==1 && s[i]==0) { rear=rear+1; q[rear]=i; s[i]=1; } } } int main() { printf("Enter the number of nodes : "); scanf("%d",&n); printf("\n Enter the adjacency matrix\n"); for(i=1;i<=n;i++)t;
Editor is loading...
Leave a Comment