Fully Dynamic Connectivity Problem Implementation

Правка en4, от IhateProgramming, 2019-03-01 19:33:43

Can someone provide me with a good implementation of the offline solution of the fully dynamic connectivity problem ? I think I got the idea but I'm having trouble implementing it. UPD: Guys I found the stupid bug in my implementation. I am sharing my code right now (my implementation is with segment tree instead of divide and conquer, which is pretty much the same) and I hope you will find it helpful. Code

Теги #graphs, #implementation, dynamic connectivity, #help

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en4 Английский IhateProgramming 2019-03-01 19:33:43 260
en3 Английский IhateProgramming 2019-03-01 14:30:25 5 Tiny change: 'rovide me a good im' -> 'rovide me with a good im'
en2 Английский IhateProgramming 2019-03-01 14:29:00 15
en1 Английский IhateProgramming 2019-03-01 14:28:14 210 Initial revision (published)