Memory leaks in adjacency_list?

[Douglas Gregor]

Hello,
I've been in fight with memory leaks in my application for some days. 
And 
now I found that most memory is losing while using adjacency_list<> 
(boost 
1.33.1 + VC++6.0). Basically we've lost about 100Kb after each graph 
life 
cycle (created - changed - removing). Moreover, I guess, I found the 
similar 
problem on the very simple test: 

#include "..\boost_1_33_1\boost\graph\adjacency_list.hpp"
using namespace boost;
typedef adjacency_list<> Graph;
void main()
{
int num_vertex = 10000;
Graph* graph = new Graph();
for(int j=0; j<num_vertex; ++j)
{
 add_vertex(graph);
}
delete graph;
} 

Here I've lost some memory too (about 20 Kb). Maybe I'm doing 
something 
wrong? 

Thanks 

_______________________________________________
Boost-users mailing list
Boost-users@lists.boost.org
http://lists.boost.org/mailman/listinfo.cgi/boost-users

[Douglas Gregor]

Logged In: YES 
user_id=249098
Originator: YES

I've been doing a bunch of testing with this code and a variety of adjacency_list instances, using manual object tracking and valgrind to look for leaks, but as far as I can tell none of the configurations of adjacency_list are leaking any memory. I don't know if this is a system-dependent problem or a false alarm (memory pooling can sometimes trick leak detectors into seeing leaks that aren't there), but I'm closing this bug unless we get further information that there is, in fact, a leak.