We can use Breadth First Search $($BFS$)$ instead of Dijkstra's algorithm to find out the shortest path from the given source node to every other node only $\_\_\_\_\_\_.$

When all the edge weights are strictly greater than $1.$

When all the edge weights are distinct.

When all the edge weights are equal.

When graph has cycles.