title: how to find Connected Component dynamically
body: <p>Using disjoint-set data structure can easily get connected component of Graph. And, it just supports <a href="http://www.boost.org/doc/libs/1_46_1/libs/graph/doc/incremental_components.html" rel="noreferrer">Incremental Connected Components</a>.</p>
  <p>However, in my case, removing edge is very common so that I am looking for an algorithm or new  structure can maintain Connected Components <strong>fully dynamically</strong>(including adding and removing edge)</p>
  <p>Thanks</p>