RestingRajarshi's blog

By RestingRajarshi, history, 5 years ago, In English

I have a dynamic connecticity problem, but with a additional constraint. The edges that can be added cannot be removed, and the edges that are being removed, cannot be added back. We initially have a graph too, so basically, the edges that are present in the initial graph can be removed, and new edges can be added, but the edges that are added later cannot be removed. they are permanant. Is there a simpler solution to this problem, than the normal fully connected dynamic connectivity problem?

P.S: can someone give me a link to any problem based on online fully dynamic connectivity.

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

»
5 years ago, # |
  Vote: I like it 0 Vote: I do not like it

There is a dynamic connectivity contest in the gym here : http://codeforces.com/gym/100551

I'm not sure if it's online.