Hi, I'm implementing a graph algorithm that requires a lot of repeated iteration over a graph as it builds it. So I wonder about cache misses. Is it possible to use a pooled allocator with the vector/list that gets used in the VertexList and EdgeList properties of adjacency_list? If there are other techniques for improving search/iteration performance (at the cost of insertion), I'd also be interested. Thanks! Jeremy