There are several well-known space and time efficient data-structures that answer membership/connectivity queries. The main drawback has typically been that wh

There are several well-known space and time efficient data-structures that answer membership/connectivity queries. The main drawback has typically been that whilst they can be made to be incremental (e.g. the addition of vertices or edges) quite easily, they don't retain enough information to be made fully dynamic (addition AND removal of vertices and edges) without prohibitively increasing the space complexity required. This data-structure, however, has particularly good time/space properties that make it interesting to anyone working on large-scale graph-analytical problems with a temporal component.