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
| Status | Source | Problem Name | Difficulty | Tags | Solution |
|---|---|---|---|---|---|
| CSES | Easy | View Solution |
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 |
|---|---|---|---|---|---|
| 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
| Status | Source | Problem Name | Difficulty | Tags | Solution |
|---|---|---|---|---|---|
| CSES | Normal | View Solution |
(impl)
Tutorial
| Resources | |||
|---|---|---|---|
| CF | |||
(KACTL at most one?)
Module Progress:
Give Us Feedback on Strongly Connected Components!
Join the Discussion!
Feel free to voice your thoughts in the comments section.