cency matrix. Following are some key points about each representation. (For examples, see today's Prezi.)</p>
<ul>
<li><strong>Adjacency List</strong></li>
</ul>
<ul>
<ul>
<li>An adjacency list is a collection of lists. For each vertex in our graph, we maintain a list of all the vertices it is adjacent to. The traditional conception of an adjacency list is as an array of linked lists, but because looking up elements in a linked list can be slow -- O(n) in the worst case -- it's not uncommon to implement an 