Give an algorithm that determines whether or not a given undirected graph G =(V,E) contains a cycle. Your algorithm should run in O(V) time, independent of |E|.
# | User | Rating |
---|---|---|
1 | jiangly | 3846 |
2 | tourist | 3799 |
3 | orzdevinwang | 3706 |
4 | jqdai0815 | 3682 |
5 | ksun48 | 3590 |
6 | Ormlis | 3533 |
7 | Benq | 3468 |
8 | Radewoosh | 3463 |
9 | ecnerwala | 3451 |
9 | Um_nik | 3451 |
# | User | Contrib. |
---|---|---|
1 | cry | 165 |
2 | -is-this-fft- | 160 |
2 | Qingyu | 160 |
4 | atcoder_official | 156 |
5 | Dominater069 | 155 |
6 | adamant | 154 |
7 | djm03178 | 151 |
8 | luogu_official | 149 |
9 | awoo | 147 |
10 | Um_nik | 146 |
Give an algorithm that determines whether or not a given undirected graph G =(V,E) contains a cycle. Your algorithm should run in O(V) time, independent of |E|.
Name |
---|
Yes, they can
To be serious, the algorithm you know using dfs should work in O(V) time. Because until you find a cycle you will try only edges of the tree, so that is O(V).
Another approach is |E| >= |V| => contains cycle, else O(E) = O(V), so you can do simple algorithm, too.
Have you tried to google it?
If |E| >= |V| graph has a cycle. else you can use dfs. It would be in O(V).
Thanks everybody!
Why thank the ones who didn't help?