Re: [igraph] shortest paths and ram

[Tamas Nepusz]

Hi Davide,

Tweaking a few lines in the Python interface seems to have solved the  
memory leak problem for me:

http://bazaar.launchpad.net/~igraph/igraph/0.6-main/revision/1545

--
Tamas

On 2009.06.10., at 16:52, Davide Setti wrote:

> 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
>
>
> _______________________________________________
> igraph-help mailing list
> address@hidden
> http://lists.nongnu.org/mailman/listinfo/igraph-help