[prev] 43 [next]

Exercise #6:

Analyse storage cost and time complexity of adjacency list representation