Deﬁning a Graph Database
• Every element (i.e. vertex or edge) has a direct pointer to
its adjacent element.
• No O(log2(n)) index lookup required to determine which
vertex is adjacent to which other vertex.
• If the graph is connected, the graph as a whole is a single
atomic data structure.