Skip to content

Latest commit

 

History

History
5 lines (3 loc) · 309 Bytes

File metadata and controls

5 lines (3 loc) · 309 Bytes

dgraph

An implementation of the algorithm for fully dynamic connectivity described in

Holm, J., De Lichtenberg, K., & Thorup, M. (2001). Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity. Journal of the ACM (JACM), 48(4), 723-760.