Adjacency Matrix
Is a way to [see page 3, store] a graph, where we maintain a \( |V| \times |V| \) matrix and if an edge between two vertices \( i \) and \( j \) exist then \( M[i,j] = 1 \).
Determining whether there's an edge between two vertices takes linear time \( \O(1) \).