A data-structure that, given a forest, allows dynamic-connectivity queries. Meaning deletion of an edge (u,v) and checking whether two vertecies are still connected. # Complexity The preprocessing phase runs in O(n) time, where n is the number of vertecies in the forest. Deletion runs in O(log n) and checking for connectivity runs in O(1) time. # Sources used Wikipedia as reference: <https://en.
source not stored for this graph (policy: none)
nothing calls this directly
no outgoing calls
no test coverage detected