Critical Connections (Bridges)

Given a connected undirected graph, print the number of bridges: edges whose removal disconnects the graph.

2 <= n <= 10^5 n - 1 <= m <= 10^5