A run-length-encoded tree data structure for efficient look-ups into a massive-but-sparse adjacency matrix.  Also includes a few fun C++11 primitives for array management.  Can determine if a vertex is unconnected in O(1) time.