2edge connected graph means the graph is always connected if we remove any edge of that graph. time=0; 2edgeconnected(v) { visited[v]=1; arr[v]=time++; int xyz=arr[v]; asked 03 Jul '14, 12:06

Equality will hold for the root node, u need to take care of that case answered 06 Dec '17, 23:21

Equality will hold for the root node, u need to take care of that case answered 06 Dec '17, 23:22

Useful one... But same problem can be solved by following two checks:
If both of above two conditions hold true, graph is 2edge connected. Time Complexity of this Solution: O(N+M) Above two DFS can also be combined into a single DFS to improve time complexity. Anyways, Nice editorial. answered 06 Dec '17, 23:52
