Critical Connections in a Network
Find every link whose loss cuts the network in two. Why "remove each link and search again" is too slow, and how one DFS with discovery times finds all the bridges.
Spotted a mistake in this lesson?Report an issue →
Find every link whose loss cuts the network in two. Why "remove each link and search again" is too slow, and how one DFS with discovery times finds all the bridges.