How to find the nearest node using BFS?

Question

Let G(V,E) be an undirected unweighted graph and r be a subset of V. Now node root is added to G and edges are a