Given all edges in a forest (multiple n-ary trees), print all the start vertex and end vertex combinations.

Please tell me how to solve this question. I did not get this question, so I don't have sample input or output. But any help would be appreciated. Thanks.