Graphs
	• One common way of implementing a graph is to use an adjacency list. • Using this approach, imagine that the vertices are numbered 1,2, thru N. • This type of implementation consists of N linked lists. • There is a node in the ith linked list for the vertex j if and only if there is an edge from vertex i to vertex j.