Is this code to detect cycle in an undirected graph correct. I have run it on a few test cases and it seems good . Can someone from the community verify it.
code:
code
# | User | Rating |
---|---|---|
1 | ecnerwala | 3648 |
2 | Benq | 3580 |
3 | orzdevinwang | 3570 |
4 | cnnfls_csy | 3569 |
5 | Geothermal | 3568 |
6 | tourist | 3565 |
7 | maroonrk | 3530 |
8 | Radewoosh | 3520 |
9 | Um_nik | 3481 |
10 | jiangly | 3467 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 164 |
2 | adamant | 164 |
4 | TheScrasse | 159 |
4 | nor | 159 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 150 |
8 | SecondThread | 147 |
9 | orz | 146 |
10 | pajenegod | 145 |
Cycle Detection Doubt
Is this code to detect cycle in an undirected graph correct. I have run it on a few test cases and it seems good . Can someone from the community verify it.
code:
// p is parent
// s is source
// adj is adjacency list representation of graph
// path is to store cycle and is a set
// ch is children/neighbor of s;
bool dfs(ll s,ll p)
{
visited[s]=true; for(auto ch:adj[s]) { if(ch!=p&&visited[ch]) { path.insert(ch); return true; } if(!visited[ch]) { if(dfs(ch,s)) { path.insert(ch); return true; } } } return false;
}
Name |
---|