Efficient Graph data structure that supports very fast node and edge deletion in C++

Question

I am looking for a graph that supports very fast edge and node deletion. I am currently using an adjacency list like this

std::vector&