How does Breadth First Search find shortest path from source vertex to destination vertex?

Question

I was told that BFS can give you the shortest path from the source vertex to the destination vertex, which makes sense since you traverse the adjacent nodes. However, I do n