dsa2 min read
Tarjan's Algorithm — Strongly Connected Components
Find all strongly connected components in a directed graph using Tarjan's single-pass DFS algorithm with discovery time, low-link values, and a stack.
Read →
Tarjan
2 articles
dsa2 min read
Find Critical Connections in Network — Bridge Finding
LeetCode 1192: Find all critical edges (bridges) in a network. A connection is critical if removing it disconnects the network. Uses Tarjan's bridge algorithm.
Read →