ices can be done in O(k) time with the adjacency list representation.</li>
</ul>
</ul>
<ul>
<li><strong>Adjacency Matrix</strong></li>
</ul>
<ul>
<ul>
<li>An adjacency matrix is an <em>n</em>-by-<em>n</em> grid (or 2D array) where the cell at row&nbsp;<em>i</em> and column&nbsp;<em>j</em> indicates whether there is an edge from vertex&nbsp;<em>i</em> to vertex <em>j</em>. Such a matrix could use boolean values to represent the presence (or lack thereof) of an unweighted edge, numeric values to represent edg