PrevNext
Rare
 0/9

Strongly Connected Components

Author: Benjamin Qi

Subsets of nodes in directed graphs where each node in a subset can reach each other node in the subset.

SCCs

StatusSourceProblem NameDifficultyTagsSolutionURL
CSESEasyView Solution

Tutorial

Resources
CPH
CPC
CP2
Benqconcise implementation of Kosaraju's Algorithm
Benqconcise implementation of Tarjan's Algorithm

Problems

StatusSourceProblem NameDifficultyTagsSolutionURL
CSESEasyShow Sketch
POIEasy
Show Tags

SCC, dp

Show Sketch
Old GoldNormalExternal Sol
CFNormalCheck CF
POIHardExternal Sol
KattisHardView Solution
CSESHardView Solution

2-SAT

StatusSourceProblem NameDifficultyTagsSolutionURL
CSESNormalView Solution

(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.

PrevNext