67 lines
1.7 KiB
Text
67 lines
1.7 KiB
Text
---
|
|
id: SCC
|
|
title: "Strongly Connected Components"
|
|
author: Benjamin Qi
|
|
prerequisites:
|
|
- Gold - Topological Sort
|
|
- Platinum - BCCs and 2CCs
|
|
description:
|
|
frequency: 1
|
|
---
|
|
|
|
import { Problem } from "../models";
|
|
|
|
export const metadata = {
|
|
problems: {
|
|
ex: [
|
|
new Problem("CSES", "Planets & Kingdoms", "1683", "Easy", false, [], ""),
|
|
],
|
|
general: [
|
|
new Problem("CSES", "Coin Collector", "1686", "Easy", false, [], ""),
|
|
new Problem("Old Gold", "Grass Cownoisseur", "516", "Normal", false, [], ""),
|
|
new Problem("CF", "Catowice City", "contest/1239/problem/D", "Normal", false, [], ""),
|
|
new Problem("POI", "Festival", "https://szkopul.edu.pl/problemset/problem/p9uJo01RR9ouMLLAYroFuQ-7/site/?key=statement", "Hard", false, [], ""),
|
|
new Problem("Kattis", "Proving Equivalences", "equivalences", "Hard", false, [], ""),
|
|
new Problem("CSES", "New Flight Routes", "1685", "Hard", false, [], ""),
|
|
],
|
|
satEx: [
|
|
new Problem("CSES", "Giant Pizza", "1684", "Normal", false, [], "")
|
|
],
|
|
}
|
|
};
|
|
|
|
## SCCs
|
|
|
|
<problems-list problems={metadata.problems.ex} />
|
|
|
|
### Tutorial
|
|
|
|
- Wikipedia
|
|
- [Tarjan](https://en.wikipedia.org/wiki/Tarjan%27s_strongly_connected_components_algorithm)
|
|
- [Kosaraju](https://en.wikipedia.org/wiki/Kosaraju%27s_algorithm)
|
|
|
|
<resources>
|
|
<resource source="CPH" title="17 - Strong Connectivity"></resource>
|
|
<resource source="CPC" title="7 - Graphs 1" url="07_graphs_1"></resource>
|
|
</resources>
|
|
|
|
(impls)
|
|
|
|
### Problems
|
|
|
|
<problems-list problems={metadata.problems.general} />
|
|
|
|
## 2-SAT
|
|
|
|
<problems-list problems={metadata.problems.satEx} />
|
|
|
|
(impl)
|
|
|
|
### Tutorial
|
|
|
|
<resources>
|
|
<resource source="CF" title="2-SAT" url="blog/entry/16205"></resource>
|
|
</resources>
|
|
|
|
(KACTL at most one?)
|