How to store distances of nodes from root in breadth-first tree?

Question

Let G(V,E) be an undirected graph. I want create a breadth-first tree from it storing distance from root to all the vertices in the graph. please help.