Multiple ChoiceHard 30s
Tarjan's SCC
Tarjan's algorithm finds SCCs in:
Options
- 1O(E log V) with a min-heap
- 2O(V+E) using a single DFS
- 3O(V3) recompute for every pair
- 4O(V2) scan of adjacency matrix
Think you can answer under pressure?
Get matched and answer live questions in 3-minute 1v1 battles. Elo ranking, badge tiers and bragging rights on the line.