0 votes 0 votes state TRUE or FALSE. and why Running a DFS on an undirected graph G = (V;E) always produces the same number of cross edges, no matter what order the vertex list V is in and no matter what order the adjacency lists for each vertex are in. Algorithms depth-first-search graph-algorithm + – Rishav Kumar Singh asked Aug 2, 2018 Rishav Kumar Singh 777 views answer comment Share Follow See all 4 Comments See all 4 4 Comments reply Shaik Masthan commented Aug 2, 2018 reply Follow Share True right? 1 votes 1 votes Rishav Kumar Singh commented Aug 2, 2018 reply Follow Share yes but how? In my knowledge DFS in an undirected graph never produces cross edges. 0 votes 0 votes Shaik Masthan commented Aug 2, 2018 reply Follow Share DFS in an undirected graph never produces cross edges. yes, therefore always 0 1 votes 1 votes Rishav Kumar Singh commented Aug 2, 2018 reply Follow Share oh, Now i got it, thanks Shaik Masthan 0 votes 0 votes Please log in or register to add a comment.