February 2020
Beginner to intermediate
616 pages
15h 16m
English
In an adjacency list representation, linked lists are used to represent the adjacent vertices of a vertex. That is, a separate linked list is made for the adjacent vertices of each vertex, and, in the end, all the vertices of the graph are connected. Because linked lists are used, this way of representing a graph uses memory in a more optimized manner.
Consider the following directed graph:

Its adjacency list representation is as follows:

You can see in ...
Read now
Unlock full access