| # | User | Rating |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | Kevin114514 | 3603 |
| 4 | jiangly | 3583 |
| 5 | strapple | 3515 |
| 6 | tourist | 3470 |
| 7 | dXqwq | 3436 |
| 8 | Radewoosh | 3415 |
| 9 | Otomachi_Una | 3413 |
| 10 | Um_nik | 3376 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 158 |
| 2 | adamant | 152 |
| 3 | Proof_by_QED | 146 |
| 3 | Um_nik | 146 |
| 5 | Dominater069 | 144 |
| 6 | errorgorn | 141 |
| 7 | cry | 139 |
| 8 | YuukiS | 135 |
| 9 | chromate00 | 134 |
| 9 | TheScrasse | 134 |
My ICT teacher asked me to give a short lecture at school on a programming topic I'm interested in. I chose finding strongly connected components in a directed graph. I'd like to include a problem to have some context.
Can you recommend simple SCC problems with no other algorithm needed I can use for the lecture?
CSES- Flight Routes Check
https://cses.fi/problemset/task/1682
CSES- Planets and Kingdoms
https://cses.fi/problemset/task/1683
CSES- Coin Collector
https://cses.fi/problemset/task/1686
The first one does not require knowledge of Strongly Connected Components but it can be solved using the concept. The second one is probably the most instructive. The third one requires applying DP to the constructed components, you can take it up if you have time
Thank you so much.