Computer Science · Graph Algorithms
Which of the following statements accurately describes the structural definition of Strongly Connected Components (SCC) and the methodological sequence of Kosaraju's algorithm?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1An SCC is defined as a graph partitioning scheme that strictly prohibits odd cycles, and Kosaraju's algorithm computes it by first reversing the graph and then performing a DFS in order of increasing discovery times.
- 2An SCC represents a minimal connected subgraph covering every vertex, and Kosaraju's algorithm computes it by globally sorting edges in ascending order before performing two successive Breadth-First Searches.
- 3An SCC is a maximal set where every vertex is reachable from every other vertex, and Kosaraju's algorithm computes it by executing a DFS for finishing times, reversing the graph, and performing a second DFS in decreasing finish time order.✓
- 4An SCC is a maximal set of vertices without directed cycles, and Kosaraju's algorithm computes it by performing a single Depth-First Search to find discovery times followed by reversing the vertex order.
Correct answer
An SCC is a maximal set where every vertex is reachable from every other vertex, and Kosaraju's algorithm computes it by executing a DFS for finishing times, reversing the graph, and performing a second DFS in decreasing finish time order.
Download Single Question PDF
Save this question and verified answer as a clean study sheet with live clickable link.
👥
Share with Friends & Study Groups
Challenge your peer aspirants on WhatsApp or Telegram to solve this question!
Online Test Series
Start Free Mock Test →Preparing for Computer Science?
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
Chapter Practice
Practice Graph Algorithms MCQs →Want more practice questions on Graph Algorithms?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Graph Algorithms