How can a directed graph be converted into a DAG (directed acyclic graph)?
Are there any standard algorithms or resources I can refer to ?
currently solving a cses problem , in which i needed this .... ;)
How can a directed graph be converted into a DAG (directed acyclic graph)?
Are there any standard algorithms or resources I can refer to ?
currently solving a cses problem , in which i needed this .... ;)
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3676 |
| 2 | Kevin114514 | 3659 |
| 3 | jiangly | 3640 |
| 4 | turmax | 3450 |
| 5 | tourist | 3382 |
| 6 | strapple | 3360 |
| 7 | Um_nik | 3354 |
| 8 | squareOf105 | 3348 |
| 9 | maroonrk | 3312 |
| 10 | idontwannadothis…e | 3191 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 155 |
| 2 | nik_exists | 151 |
| 3 | maspy | 149 |
| 4 | AmShZ | 145 |
| 5 | Um_nik | 143 |
| 6 | Errichto | 139 |
| 7 | BledDest | 136 |
| 8 | adamant | 134 |
| 9 | maroonrk | 132 |
| 10 | cry | 130 |
Maybe this helps — https://cp-algorithms.com/graph/strongly-connected-components.html
This is called Strongly Connected Components (SCC).
You can check some resources: USACO Guide, CP-Algorithms