plz check my code
BFS - Shortest Path Promblem
When dist[i] == INT_MAX your code prints twice. Firstly, -1 then value at dist[i]. Add else at line 58.
plz check my code
When dist[i] == INT_MAX your code prints twice. Firstly, -1 then value at dist[i]. Add else at line 58.