t one of the diagonals.</li>
</ul>
</ul>
<ul>
<ul>
<li>Given some vertex in our graph, if we want to list all the vertices adjacent to that one, we have to loop through the entire row for that vertex in our adjacency matrix: an O(n) operation. If a vertex is only adjacent to&nbsp;<em>k</em> other vertices in the graph and&nbsp;<em>k</em> is significantly smaller than&nbsp;<em>n</em>, this operation ends up being significantly slower than what we would encounter with an adjacency list.</li>
</ul>
</ul>
<ul>
