Strongly Connected Components — Kosaraju
Kosaraju finds strongly connected components in a directed graph using two DFS passes and the transposed graph.
이 멘탈 모델부터 시작하세요
Kosaraju finds strongly connected components in a directed graph using two DFS passes and the transposed graph.
불필요한 전문용어 없이 동작 방식 이해하기
First DFS records vertices by finishing time.
Reverse all edges, then DFS in decreasing finish-time order; each traversal forms one SCC.
알고리즘을 연속된 의사결정으로 읽기
Define directed/undirected and weighted/unweighted assumptions.
Choose the graph representation.
Track algorithm state and handle disconnected/cyclic cases explicitly.
Read a tiny input by hand and write down the state after every important operation. For Strongly Connected Components — Kosaraju, the goal is to make the invariant visible rather than to memorize code.
Varies by implementation / input constraints
Do not quote this complexity mechanically. Ask which operation or input dimension it describes, then derive the cost from the loops, recursion depth, data-structure operations and any preprocessing assumptions.
적합한 경우
- Use the algorithm only when its graph assumptions match the problem.
보통 어디에서 문제가 생기는가
- Forgetting disconnected components.
- Mixing weighted and unweighted shortest-path algorithms.
- Not protecting against revisits/cycles.
전문적인 답변 구조
Explain why transpose preserves nodes inside each SCC while reversing the edges between SCCs; that is the intuition behind the two passes.
What problem does Strongly Connected Components — Kosaraju solve?
Kosaraju finds strongly connected components in a directed graph using two DFS passes and the transposed graph.
복잡도에 대해 무엇을 언급해야 하나요?
Its typical cost here is Varies by implementation / input constraints, but a complete answer should connect that cost to the representation, input constraints and the dominant operations.
가장 흔한 실수는 무엇인가요?
Forgetting disconnected components.