inked lists) and potentially slow, O(n) lookup runtimes (which could happen even with hash tables, if we happen to encounter an excessive number of collisions). So, if our graph is <strong>dense</strong>, and we have to deal with using O(n<sup>2</sup>) space to represent our graph, we might be better off switching to an adjacency matrix representation, which uses that amount of space but guarantees fast insertion and lookup runtimes. If our graph is&nbsp;<strong>sparse</strong>, the adjacency list is probab