00:01
Hello, so here we have our given graph g.
00:04
Now, an adjacency list for a directed graph represents the graph by listing all the vertices that are the terminal edges of the edges starting at each vertex of the graph.
00:13
So here we have a graph.
00:14
The arrows here point basically the direction that we are going.
00:18
So we can make our list here.
00:20
We can say this is going to be our initial vertex.
00:23
So i .b here is the initial vertex.
00:26
And we have terminal vertex.
00:28
Okay, so the a, well, for the initial vertex of a, where do we go? we can see that a actually goes to itself, and then a goes to b, a goes to c, and a also goes to d...