title: How is the memory required for adjacency list representation is O(V+E)?
body: <p>How is this statement valid? </p>
  
  <p>"For both directed and undirected graphs, the adjacency-list representation has the desirable property that the amount of memory it requires is O(V+E)."</p>
  
  <p>source: introduction to algorithms, cormen.</p>