0 votes 0 votes Cross Edge(a,b) is defined as an edge between two non-ancestor nodes in DFS , so my query is that how is this stmt true : arrival[b] <departure[b] <arrival[a] <departure[a] ... Algorithms algorithms depth-first-search + – radha gogia asked Jul 5, 2015 • edited Jun 24, 2022 by makhdoom ghaya radha gogia 500 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes since for cross edge(u,v) d(u)........f(u) , d(v)......f(v) discovery and finishing time of one vertex will be different from other vertex for cross edges . i dont think so that statement is correct.. bgfbfg answered Jul 15, 2015 bgfbfg comment Share Follow See all 0 reply Please log in or register to add a comment.
