Boost Users :
Subject: [Boost-users] BGL performance: is pool_allocator possible and does it help iteration performance?
From: Jeremy Murphy (jeremy.william.murphy_at_[hidden])
Date: 2014-06-14 23:53:07
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!
Boost-users list run by williamkempf at hotmail.com, kalb at libertysoft.com, bjorn.karlsson at readsoft.com, gregod at cs.rpi.edu, wekempf at cox.net