Help needed with an interview problem

Revision en2, by Romok007, 2019-06-25 12:29:49

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. Can you please help me with a solution?

Tags #help, #interview

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en4 English Romok007 2019-06-25 18:32:34 10 Tiny change: 'ndirected grap' -> 'ndirected connected grap'
en3 English Romok007 2019-06-25 15:55:07 60
en2 English Romok007 2019-06-25 12:29:49 4 Tiny change: 's follows given an un' -> 's follows : Given an un'
en1 English Romok007 2019-06-25 12:29:28 269 Initial revision (published)