title: Adjacency list representation of graphs
body: <p>In an algorithms course from Stanford, the professor listed the following ingredients for the adjacency list representation of graphs:</p>
  
  <ol>
  <li>Array or List of Vertices</li>
  <li>Array or List of Edges</li>
  <li>Each vertex in the List of Vertices points to the edges incident on it.</li>
  <li>Each edge in the List of Edges points to its edgepoints.</li>
  </ol>
  
  <p>Does this correspond to <a href="http://en.wikipedia.org/wiki/Adjacency_list" rel="nofollow">Wikipedia</a>? The object oriented incidence list structure suggested by Goodrich and Tamassia has special classes of vertex objects and edge objects?</p>
  
  <p>Is this representation same as "incidence list"  representation of graphs? If yes, why are "adjacency list" and "incidence list"  considered separated in <a href="http://www.algorithmist.com/index.php/Graph_data_structures#Incidence_List" rel="nofollow">this article</a>?</p>