Eddagdeg's blog

By Eddagdeg, history, 4 years ago, In English

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^__^

 
 
 
 
  • Vote: I like it
  • +8
  • Vote: I do not like it

»
4 years ago, # |
  Vote: I like it +8 Vote: I do not like it

This can be easily solved with Bridge Tree.

  • »
    »
    4 years ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    What about pair of nodes that are in same BCC? (One needs Min Cut for that I guess)

    • »
      »
      »
      4 years ago, # ^ |
        Vote: I like it 0 Vote: I do not like it

      They are not disconnected by definition

      • »
        »
        »
        »
        4 years ago, # ^ |
          Vote: I like it 0 Vote: I do not like it

        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? ^

        • »
          »
          »
          »
          »
          4 years ago, # ^ |
            Vote: I like it 0 Vote: I do not like it

          It’s min cut by definition, given that answer >= 2

»
4 years ago, # |
Rev. 2   Vote: I like it 0 Vote: I do not like it

Thanks to all of you^__^