A bridge (critical edge) in an undirected graph is an edge whose removal increases the number of connected components.
I need to determine all critical edges in an undirected graph, in $O(V+E)$ time. From what I found out, I need to use a modified DF search, but all pseudo-code algorithms I found have
d[v] which I don't understand.
Can someone please explain to me the $O(V+E)$ bridge determination algorithm?