In BFS-Shortest Path

parvezaalam786 · September 5, 2019, 4:14pm

How we have to print the distance from the source vertex?? If some node is not connected directly to the source then we have to print -1??

S18LP0016 · September 6, 2019, 8:43am

if a vertex is not directly connected to source, it may be having some path from source to that vertex.
for example: 1->2->3 in this path, distance of vertex 3 from 1 is 2, so in this case, you will print 2(for vertex 3)
disconnected implies you cannot reach a vertex irrespective of the path you follow.
for example: 1->2 3, here 3 is disconnected from 1, so you will print -1(for vertex 3)

S18LP0016 · September 7, 2019, 10:53am

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.

Robin_rst · January 24, 2020, 4:10pm

Refer this -:
Comments are added.

github.com

robinrst/HackerBlocks/blob/master/BFS.cpp

#include "bits/stdc++.h"

using namespace std;

#define  f first
#define  lgn 25
#define  endl '\n'
#define  sc second
#define  N (int)2e5+5
#define  sz(x) x.size()
#define  int long long int
#define  ld long double
#define  vi vector<int>
#define  vs vector<string>
#define  vc vector<char>
#define  mii map<int,int>
#define  pii pair<int,int>
#define  vpii vector<pii>
#define  test(x) while(x--)
#define  pb push_back

This file has been truncated. show original

Robin_rst · January 30, 2020, 7:51pm

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.