It might be silly question for pro coders. It is very basic question .I actually googled but could not understand well.
So the question is why the way of finding cycle is different for directed and undirected graph ?
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3823 |
3 | Benq | 3738 |
4 | Radewoosh | 3633 |
5 | jqdai0815 | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | ksun48 | 3390 |
10 | gamegame | 3386 |
# | User | Contrib. |
---|---|---|
1 | cry | 167 |
2 | Um_nik | 163 |
3 | maomao90 | 162 |
3 | atcoder_official | 162 |
5 | adamant | 159 |
6 | -is-this-fft- | 158 |
7 | awoo | 157 |
8 | TheScrasse | 154 |
9 | Dominater069 | 153 |
9 | nor | 153 |
Name |
---|
In undirected graph, you have to keep track of parent node also. Example given an undirected graph as:
2 1
1 2
if you apply directed graph cycle check method then it would give you a cycle (1-2-1) which is not the case
There are more than one ways to find cycles and they don't have to be different for the two types of graphs. For example, DFS will work for both.