btrekkie / dynamic-connectivity
View external linksLinks

Data structure for dynamic connectivity in undirected graphs. Supports adding and removing edges and checking whether two vertices are connected (there's a path between them) in polylogarithmic time.
18Apr 29, 2023Updated 2 years ago

Alternatives and similar repositories for dynamic-connectivity

Users that are interested in dynamic-connectivity are comparing it to the libraries listed below

Sorting:

Are these results useful?