Hello everyone. The question goes as follows : Given an unweighted undirected graph we need to construct the tree with minimum depth such that the tree consists of all the vertices of the graph. Any thoughts about the approach? Thank you in advance :).