ly a good choice of representation.</li>
</ul>
</ul>
<ul>
<ul>
<li>If we have a sparse graph and each adjacency list has an average length of O(1) (some small constant number of vertices), then our overall space complexity is O(n).</li>
</ul>
</ul>
<ul>
<ul>
<li>Given some vertex, we can efficiently list all the vertices adjacent to that one by just iterating over the list associated with that vertex. If some vertex, <em>v</em>, is adjacent to&nbsp;<em>k</em> other vertices, iterating over that list of vert