##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
(Critical edges and vertices)
Finding weak spots in networks
Edge whose removal disconnects
(Visualizing critical edges)
Network reliability applica...
Vertex whose removal discon...
Visualizing critical vertices
Foundation for Tarjan's algo
(Tree edges vs back edges)
Cycles provide alternate paths
(When DFS first visits vertex)
(Earliest reachable ancestor)
(Can you escape the subtree?)
Computing values step by step
Knowledge check
(One-pass DFS solution)
(When is an edge a bridge?)
(DFS with discovery and low)
(Step-by-step execution)
Knowledge check
(Finding critical vertices)
(Root with multiple children)
(Child cannot bypass parent)
(DFS with discovery and low)
(Step-by-step execution)
Knowledge check
(Bridge in network graph)
(LeetCode 1192)
(Visualizing the network)
Apply Tarjan's bridge algo
(Tarjan's bridge detection)
(Python with DFS)
(Running Tarjan's algorithm)
(Linear in edges)
(Single edge and cycles)
(What you learned)
(Maximal set without bridges)
(Contract non-bridge edges)
(Visualizing the structure)
Knowledge check
(Critical vertices in network)
(Graph with critical vertices)
Apply Tarjan's vertex algo
(DFS-based detection)
(Python with DFS)
(Step-by-step execution)
(Linear in edges)
Single vertex and complete ...
(What you learned)
Knowledge check
Identifying single points o...
Dividing graphs at weak points
(Fault tolerance in circuits)
Maximal subgraph without ar...
(Using edge stack during DFS)
Condensing 2-edge-connected...
Knowledge check
(Condensing a graph)
(What you learned)