An edge $e = uv$ of a connected graph $G$ is called a bridge if $G - e$ is disconnected (it increases the number of components).
In this article, I implement an algorithm to find the bridges of an undirected graph using DFS.
Next, I describe an algorithm to find strong bridges in directed graphs.
Published on Wed, Jun 24, 2015 • 4 min read
#graph theory
#cut edges
#bridges
#depth first search
