Week 3: Graph Data Structures and Algorithms (37)

For each vertex, store linked list of adjacent vertices:

relatively easy to implement in languages like C
can represent graphs and digraphs
memory efficient if E:V relatively small
disadvantage: one graph has many possible representations
(unless lists are ordered by same criterion e.g. ascending)