Adjacency list representation of graphs

Question

In an algorithms course from Stanford, the professor listed the following ingredients for the adjacency list representation of graphs:

1. Array or List of Vertices
2. Array or List of Edges
3. Each vertex in the List of Vertices points to the edges incident on it.
4. Each edge in the List of Edges points to its edgepoints.

Does this correspond to Wikipedia? The object oriented incidence list structure suggested by Goodrich and Tamassia has special classes of vertex objects and edge objects?

Is this representation same as "incidence list" representation of graphs? If yes, why are "adjacency list" and "incidence list" considered separated in this article?

Answer 1

I guess that the author of the article would call that structure an incidence list, since nodes link to other nodes via edges rather than directly. The incidence list/adjacency list distinction is nonstandard and IMHO not terribly useful because both structures have similar performance characteristics and because it's not clear that the distinction is well-founded if one strips away the list ADT.