unordered_set query time is 5 times slower than vector query

Question

I want to deal with graphs in C++. Using adjacency matrix is find but take too much memory for some of my instances. Therefore, I tried to use adjacency list, where each ver