BFS shortest path

#1

what is the problem in the code?
As i am failing testcase 2

#2

@Divyakharb, the code you shared does’nt seem to be code for BFS shortest path

#3

plz check the code at /240722

#4

@Divyakharb, you have applied algo correctly but there is a mistake while printing the result
you are missing the case when dist[i] == INT_MAX as in that case dist.count()=1 but the node is still unvisited so the correct code would be

for(int i=1;i<=n;i++){
        if(i==src)
        continue;

        if(!dist.count(i)||dist[i]==INT_MAX){
            cout<<"-1 ";
        }else{
            cout<<dist[i]*6<<" ";
        }

    }