149 - Bridges (Cut Edges) in Graph | Find Bridges using Tarjan's Algorithm | Data Structure

#GraphTheory #Bridges #CutEdge #TarjanAlgorithm #DFS #CompetitiveProgramming #DataStructures #GraphAlgorithms #CodingInterview #Algorithm #DSA A bridge in a graph is an edge whose removal increases the number of connected components. It is found using DFS - Tarjan's Algorithm. ------------------------------------------------------------------------------ ⏱️ TimeStamps : 0:00 - Bridges in graph 1:00 - find bridge - tarjan's algorithm 6:36 - time complexity