0 votes 0 votes Algorithms algorithms graph-algorithms test-series + – vaishali jhalani asked Jan 7, 2017 retagged Jul 14, 2022 by makhdoom ghaya vaishali jhalani 2.7k views answer comment Share Follow See all 7 Comments See all 7 7 Comments reply Show 4 previous comments santhoshdevulapally commented Jan 7, 2017 reply Follow Share Once u refer Coreman text book for DFS traversal,then u can easily understand. parent node time intervals are u/v and child is x/y then backside lies in b/w parent.i.e)u<=x<=y<=v // condition for back edges. 0 votes 0 votes Akriti sood commented Jan 7, 2017 reply Follow Share so,whats the answer ..single or multiple?? 0 votes 0 votes MIRIYALA JEEVAN KUMA commented Jan 23, 2018 reply Follow Share https://gateoverflow.in/145735/dfs-back-edge 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes here is a result given in cormen book..... A directed graph G is acyclic iff depth first search of G yields no back edges i think b is correct saurabh rai answered Jan 7, 2017 saurabh rai comment Share Follow See all 0 reply Please log in or register to add a comment.