Faster to test if (x,y) is in graph?

Faster to find the degree of a vertex?

Less memory on small graphs?

Less memory on big graphs?

Edge insertion or deletion?

Faster to traverse the graph?

Better for most problems?