When does ordinary BFS provide a shortest-path guarantee?

When does ordinary BFS provide a shortest-path guarantee?

1. When shortest means the fewest edges, equivalently when all edges have equal cost.
2. Whenever all edge weights are nonnegative but unequal.
3. Only when the graph is represented by a matrix.
4. Whenever DFS and BFS happen to visit the same first neighbor.