0 votes 0 votes Algorithms depth-first-search graph-algorithms test-series + – iita asked Dec 17, 2016 • retagged Jul 14, 2022 by makhdoom ghaya iita 404 views answer comment Share Follow See 1 comment See all 1 1 comment reply Jaideep Bankoti commented Dec 10, 2018 reply Follow Share Answer should be d as the interval of the following vertices fall within the preceding ones. It forms a chain if you consider only given vertices. 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes D, because it is dfs and only one component so whichever first visited should finish last, and whichever visited second should finish in second last and so on. Hence D is right answer krishnakant answered Dec 10, 2018 krishnakant comment Share Follow See all 0 reply Please log in or register to add a comment.
