Implementation of adjacency list

To create a graph data structure, we need data items and the relationship between them. Just like the adjacency matrix implementation, we need the total number of nodes and a list of edges to implement an adjacency list. This information is usually available as data from the problem statement or the use case. Let's consider the following graph as an example to learn how to implement a graph using an adjacency list. 

Implementation