Query regarding Union-Find ?
Difference between en1 and en2, changed 6 character(s)
Hello Codeforces,↵

I have a graph question where both edge addition and deletion are allowed as queries.After each query, you need to maintain the component each vertex is a part of.The addition query is straight-forward merge but i don't know how to implement edge deletion query.↵


Can anyone explain or provide any link to an article which address this problem?↵

Basically, i'm looking for this- [Problem](https://en.wikipedia.org/wiki/Dynamic_connectivity#Fully_dynamic_connectivity)

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en2 English no_oneplb 2023-05-22 07:10:49 6
en1 English no_oneplb 2023-05-22 07:10:16 516 Initial revision (published)