BFS when apply on an unweighted graph , In the resultant BFS tree it can be seen that the shortest path to every vertex from root (or the start vertex) is figured out.
It is quite similar to dijsktra algorithm which is also single source shortest path.