Сравнение представления графа объектов со списком смежности и представлениями матриц

В настоящее время я следую совету Стива Йегге по подготовке к собеседованию по техническому программированию: http: //steve-yegge.blogspot. 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.

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.

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.