Intermediate
Data Structures & Algorithms
Q66 / 100
What is a graph's strongly connected component (SCC)?
Correct! Well done.
Incorrect.
The correct answer is B) A maximal subgraph where every vertex is reachable from every other vertex
B
Correct Answer
A maximal subgraph where every vertex is reachable from every other vertex
Explanation
An SCC is a maximal set of vertices such that there exists a path between any two vertices in both directions. Kosaraju's and Tarjan's algorithms find SCCs in O(V + E).
Progress
66/100