Can anybody explain me how to convert Cyclic graph into Acyclic Graph with different layers.
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 3985 |
2 | jiangly | 3814 |
3 | jqdai0815 | 3682 |
4 | Benq | 3529 |
5 | orzdevinwang | 3526 |
6 | ksun48 | 3517 |
7 | Radewoosh | 3410 |
8 | hos.lyric | 3399 |
9 | ecnerwala | 3392 |
9 | Um_nik | 3392 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | cry | 169 |
2 | maomao90 | 162 |
2 | Um_nik | 162 |
4 | atcoder_official | 161 |
5 | djm03178 | 158 |
6 | -is-this-fft- | 157 |
7 | adamant | 155 |
8 | awoo | 154 |
8 | Dominater069 | 154 |
10 | luogu_official | 151 |
Can anybody explain me how to convert Cyclic graph into Acyclic Graph with different layers.
Название |
---|
Strong name to post content. :P
Anyways, check "SCC Condensation". You can condense all SCC's of the graph, and create a directed one where each node represents a SCC. Edges exist between 2 SCC's if a node in the first SCC goes to the second in the original graph. This is of course only useful if the nature of your problem allows you to abstract the graph into that.
e-maxx article : https://cp-algorithms.com/graph/strongly-connected-components.html