Hello coders, I'm wondering how to find all edges in a graph which if removed, would disconnect a specific pair of vertices? any hint and Thanks^__^
# | 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 | adamant | 164 |
2 | awoo | 164 |
4 | TheScrasse | 160 |
5 | nor | 159 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 150 |
7 | SecondThread | 150 |
9 | orz | 146 |
10 | pajenegod | 145 |
Hello coders, I'm wondering how to find all edges in a graph which if removed, would disconnect a specific pair of vertices? any hint and Thanks^__^
Name |
---|
This can be easily solved with Bridge Tree.
What about pair of nodes that are in same BCC? (One needs Min Cut for that I guess)
They are not disconnected by definition
I guess I misunderstood the problem. I thought it was asking about minimum number of edges such that removing them will disconnect two given nodes. Which is basically min-cut in BCC.
Any idea how to solve that? ^
It’s min cut by definition, given that answer >= 2
Thanks to all of you^__^