I want to find bridges in an undirected graph without using Tarjan's algorithm(optimal). The edges that are bridges will always be present in all the spanning trees of the graph, can we use this property somehow? I know this is not O(n) but O(nlogn) but still. As of now I found the Spanning trees, and then created another DSU to keep track of nodes using edges other than the spanning tree ones. After this I add the spanning tree edges to see which ones contribute to actual combination of regions. But well, this is wrong as of now, But is there any possibility of this to be solved by Spanning trees?