1 votes 1 votes Better Explanation?? DS data-structures depth-first-search graph-algorithm + – pradeepchaudhary asked Dec 8, 2018 pradeepchaudhary 304 views answer comment Share Follow See 1 comment See all 1 1 comment reply Jaideep Bankoti commented Dec 8, 2018 reply Follow Share answer should be B) introduce a start vertex T and it forms a tree (T->Q->R | T->P | T->S) 1 votes 1 votes Please log in or register to add a comment.