Beautiful vertices graphs question

#1

I could not understand the question.

  1. How to identify the Master parent.
  2. Since the edges are bidirectional, how to identify which is the parent node and which the child node ?
  3. In question it says “vertex which has the lowest value…” Which “value” is being referred here ?
Beautiful verticesss
#2

make a array of pair
pair<int,int>p[1000]
and then take input of the edges and sort the pair array
sort(p,p+n,compare)
bool compare(){
return p1.first<p2.first}
now p[0].first is the smallest and that i sthe master parent

  1. there is nowhere written edges are birdir. so only directional
#3

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.