Re: [igraph] shortest paths and ram

[Davide Setti]

On Wed, Jun 10, 2009 at 5:34 PM, Davide Setti<address@hidden> wrote:
> I tried this, but it does not work: memory usage is always increasing.

I mean, i'm doing:

 34     for i in range(len(g.vs)):
 35         if not i % 10:
 36             gc.collect()
 37
 38         if not i % 100:
 39             print 'Step:', i
 40
 41         dSum += sum(g.shortest_paths_dijkstra(i, weights='weight')[0])

and it doesn't work.
-- 

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