Re: [igraph] shortest paths and ram

[Davide Setti]

On Wed, Jun 10, 2009 at 5:15 PM, Tamas Nepusz<address@hidden> wrote:
> What I did is: I called g.shortest_paths_dijkstra() 10
> times on your graph with a single vertex, noted that the memory usage
> went up (cat /proc/<pid>/status | grep VmSize), then called
> gc.collect(), called g.shortest_paths_dijkstra() 10 times again and
> noted that the memory usage stayed the same.

I tried this, but it does not work: memory usage is always increasing.

Thanks
-- 

Davide Setti
blog: http://blog.flatlandia.eu
home: http://www.flatlandia.eu