#include
#include
#include
using namespace std;
int cost[10][10],i,j,k,n,qu[10],front,rare,v,visit[10],visited[10];

main()
{
int m;
cout <<"enterno of vertices";
cin >> n;
cout <<"ente no of edges";
cin >> m;
cout <<"\nEDGES \n";
for(k=1;k<=m;k++)
{
cin >>i>>j;
cost[i][j]=1;
}

cout <<"enter initial vertex";
cin >>v;
cout <<"Visitied vertices\n";
cout << v;
visited[v]=1;
k=1;
while(k
OUTPUT

enterno of vertices9

ente no of edges9
EDGES

1 2

2 3

1 5

1 4

4 7

7 8

8 9

2 6

5 7

enter initial vertex1

Visited vertices

12 4 5 3 6 7 8 9
The post C++ programs for the implementation of Breadth First Search(BFS) for a given graph first appeared on Student Projects.
]]>
					
					https://studentprojects.in/software-development/cpp/cpp-programs/cpp-data-structure/c-programs-for-the-implementation-of-breadth-first-searchbfs-for-a-given-graph/feed/
			21