[igraph] shortest paths and ram

[Davide Setti]

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