Let us consider an unweighted graph G. Let a breadth-first traverse of G be done from a node r. Let d (r, u) and d (r, v) be the lengths of the shortest paths from r to u and v respectively, in G. of u is visited before v during the breadth-first traversal, which of the following statements is correct?

A. d(r, u) < d (r, v)

B. d(r, u) > d(r, v)

C. d(r, u) <= d (r, v)

D. None of the above