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^__^
→ Pay attention
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3676 |
| 2 | Kevin114514 | 3659 |
| 3 | jiangly | 3640 |
| 4 | turmax | 3450 |
| 5 | tourist | 3382 |
| 6 | strapple | 3360 |
| 7 | Um_nik | 3354 |
| 8 | squareOf105 | 3348 |
| 9 | maroonrk | 3312 |
| 10 | idontwannadothis…e | 3191 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 155 |
| 2 | nik_exists | 151 |
| 3 | maspy | 149 |
| 4 | AmShZ | 145 |
| 5 | Um_nik | 143 |
| 6 | Errichto | 139 |
| 7 | BledDest | 136 |
| 8 | adamant | 134 |
| 9 | maroonrk | 132 |
| 10 | cry | 130 |
→ Find user
→ Recent actions
Codeforces (c) Copyright 2010-2026 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Nov/06/2026 17:26:48 (g2).
Desktop version, switch to mobile version.
Supported by
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^__^