Void BFS(vertic *recieve,int connectedWith[N][N]/*,string v*/)
{
int I=0;
queue<string> q;
q.push(recieve[I].name);
recieve[0].visited = true;
cout<<"n======nBREADTH FIRSST SEARCH TRAVERSING :";
cout<<"n======n ";
while(!q.empty())
{
int j=0;
cout<<q.front()<<" ";
for(int n=0;n<N; n++)
{
if( recieve[n].name == q.front() )
{
I=n;
break;
}//END OF IF
}//END OF FOR LOOP
q.pop();
for( ;j<N; j++ )
{
if(j==I)
continue;
else … Read more
