255 B
255 B
dynamic-connectivity
Data structure for dynamic connectivity in undirected graphs. The ConnGraph class supports adding and removing edges and determining whether two vertices are connected (whether there is a path between them) in polylogarithmic time.