‫So now let's look at using an adjacency list.
‫So I'm going to bring up a graph like this to store.
‫Our adjacency list will be using an unordered map.
‫So with our adjacency list to store the vertex A, which has edges with B and E, it would look like
‫this.
‫So in our key value pair, the key is going to be a a string.
‫And the value is going to be what is called an unordered set.
‫And I'll talk a little bit more about what an unordered set is in the next video, if you're not familiar
‫with that for now.
‫Think of this as a vector and then we can just move around this graph.
‫B has edges with A and C.
‫Sea has edges with B and D, D has edges with C and E and E has edges with A and D.
‫So that unordered map on the right represents the graph on the left.
‫So we could use an adjacency matrix or an adjacency list to store our graphs.
‫But in this course, we're going to use an adjacency list.