**Article:** [Breadth First Search](https://cp-algorithms.com/graph/breadth-first-search.html) **Problem:** <!-- Describe the issue of this article in detail. "In the 6th point there should be an additional condition of checking $d_a[v]+1+d_a[u]=d_a[b]$ for every edge(u,v). Only checking d_a[u]+1+d_a[v]=d_a[b] won't suffice as there can be cases when u appears closer to b than v in the shortest path from a to b. Kindly correct it. -->