I am not able to find the mistake where is the code going wrong?I am getting the correct answer for the test cases
BFS Shortest Path
Hey @aryamaan1011
Only one correction on line 18:
dist[nbrs]=dist[curr]+6;
it should be dist[curr] on rhs
I am not able to find the mistake where is the code going wrong?I am getting the correct answer for the test cases
Hey @aryamaan1011
Only one correction on line 18:
dist[nbrs]=dist[curr]+6;
it should be dist[curr] on rhs