Rare
0/9
Strongly Connected Components
Author: Benjamin Qi
Prerequisites
Subsets of nodes in directed graphs where each node in a subset can reach each other node in the subset.
SCCs
Tutorial
| Resources | |||
|---|---|---|---|
| CPH | |||
| CPC | |||
| CP2 | |||
| Benq | concise implementation of Kosaraju's Algorithm | ||
| Benq | concise implementation of Tarjan's Algorithm | ||
Problems
| Status | Source | Problem Name | Difficulty | Tags | Solution | URL |
|---|---|---|---|---|---|---|
| CSES | Easy | Show Sketch | ||||
| POI | Easy | Show TagsSCC, dp | Show Sketch | |||
| Old Gold | Normal | External Sol | ||||
| CF | Normal | Check CF | ||||
| POI | Hard | External Sol | ||||
| Kattis | Hard | View Solution | ||||
| CSES | Hard | View Solution |
2-SAT
(impl)
Tutorial
| Resources | |||
|---|---|---|---|
| CF | |||
(KACTL at most one?)
Module Progress:
Join the USACO Forum!
Stuck on a problem, or don't understand a module? Join the USACO Forum and get help from other competitive programmers!
Give Us Feedback on Strongly Connected Components!
Leave suggestions for us by making a post on the USACO Forum! Ex: Unclear sections, mislabeled problems, etc.