wengh / dynamic-connectivity Goto Github PK
View Code? Open in Web Editor NEWData 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.
License: MIT License