Tarjan's Algorithm

Category: Advanced

Difficulty: advanced

Description: Find strongly connected components

Time Complexity: O(V+E)

Space Complexity: O(V)

Related LeetCode Problems

• 207. Course Schedule (Medium)
• 210. Course Schedule II (Medium)
• 1192. Critical Connections in a Network (Hard)
• 886. Possible Bipartition (Medium)
• 797. All Paths From Source to Target (Medium)
• 133. Clone Graph (Medium)
• 315. Count of Smaller Numbers After Self (Hard)