[Top][All Lists]
[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
[igraph] shortest paths and ram
From: |
Davide Setti |
Subject: |
[igraph] shortest paths and ram |
Date: |
Wed, 10 Jun 2009 16:39:12 +0200 |
Hi all,
another (stupid? ;-) ) question: i'm trying to find the average
distance for a weighted strongly connected graph. I think that i
should use Graph.shortest_paths() looping over each node, but step
after step the ram consuption increases. The code is here:
http://github.com/vad/network-libraries-test/blob/4d6e77f955b803d08516ec8beee40b86006733d7/igraph-test.py
(function printAverageDistance())
and the dataset is:
http://www.trustlet.org/trustlet_dataset_svn/WikiNetwork/de/2008-10-11/graphCurrent.net
Is there a way to free the memory?
Thanks
--
Davide Setti
blog: http://blog.flatlandia.eu
home: http://www.flatlandia.eu
- [igraph] shortest paths and ram,
Davide Setti <=
- [igraph] Re: shortest paths and ram, Davide Setti, 2009/06/10
- Re: [igraph] shortest paths and ram, Tamas Nepusz, 2009/06/10
- Re: [igraph] shortest paths and ram, Davide Setti, 2009/06/10
- Re: [igraph] shortest paths and ram, Davide Setti, 2009/06/10
- Re: [igraph] shortest paths and ram, Tamas Nepusz, 2009/06/11
- Re: [igraph] shortest paths and ram, Tamas Nepusz, 2009/06/11
- Re: [igraph] shortest paths and ram, Davide Setti, 2009/06/12
- Re: [igraph] shortest paths and ram, Davide Setti, 2009/06/12
- Re: [igraph] shortest paths and ram, Davide Setti, 2009/06/11