title: Comparing object graph representation to adjacency list and matrix representations
body: <p>I'm currently following Steve Yegge's advice on preparing for a technical programming interview: <a href="http://steve-yegge.blogspot.com/2008/03/get-that-job-at-google.html" rel="noreferrer">http://steve-yegge.blogspot.com/2008/03/get-that-job-at-google.html</a></p>
  
  <p>In his section on Graphs, he states:</p>
  
  <blockquote>
    <p>There are three basic ways to
    represent a graph in memory (objects
    and pointers, matrix, and adjacency
    list), and you should familiarize
    yourself with each representation and
    its pros and cons.</p>
  </blockquote>
  
  <p>The pros and cons of matrix and adjacency list representations are described in CLRS, but I haven't been able to find a resource that compares these to an object representation. </p>
  
  <p>Just by thinking about it, I can infer some of this myself, but I'd like to make sure I haven't missed something important. If someone could describe this comprehensively, or point me to a resource which does so, I would greatly appreciate it.</p>