‫So now we're going to talk about unordered sets and we'll be using these in our adjacency list to store
‫edges.
‫So an unordered set is very similar to an unordered map.
‫In an unordered map, we had key value pairs where these were the keys and these were the values.
‫So an unordered set is just like this, except it doesn't have the values, it just has the keys.
‫And just like with an unordered map, look up, insert and delete are all o of one.
‫So that means that an unordered set is going to be more efficient than a vector from a big O perspective.
‫But there is another benefit of an unordered set versus using a vector for storing our edges, and that
‫is with a set.
‫There are no duplicates, so we don't have to worry about duplicate edges being stored now with a set.
‫We normally don't write it like this, we represent it like this.
‫And that is our quick overview of unordered sets.