title: How can I find bridges in an undirected graph?
body: <p>Given an undirected Graph, how can I find all the bridges? I've only found Tarjan's algorithm which seems rather complicated.</p>
  
  <p>It seems there should be multiple linear time solutions, but I can't find anything.</p>