Tag: DFS

2-Edge Connectivity in the graph

Given a undirected connected graph, check if the graph is 2-edge connected or not. A connected graph is 2-edge-connected if it remains connected whenever any edges is removed. A bridge or cut arc is an edge of a graph whose deletion increases its number of connected components. i.e. whose removal disconnects the graph. So if any such bridge exists, the graph …

Read More 2-Edge Connectivity in the graph