On 12.02.2017 12:53, P-M wrote:
> Yup, that would explain it. D is in the order of 10^5 in this case. Would I
> be able to write a more memory-efficient script manually with sparse
> matrices or is the underlying code already fairly optimised in this regard?
Of course, you could do a lot better
Yup, that would explain it. D is in the order of 10^5 in this case. Would I
be able to write a more memory-efficient script manually with sparse
matrices or is the underlying code already fairly optimised in this regard?
Best,
Philipp
--
View this message in context:
On 10.02.2017 15:14, P-M wrote:
> Those functions were very useful (as was the tip about the environment
> variable). I couldn't find them anywhere in the documentation though. Would
> it be possible to add them?
It's now in git.
> Thank you for the help, alas, in this case even limiting the
Well, yes. Though you can configure your shell and make it permanent.
Software Carpentry has some good tutorials on using the shell, for example:
http://swcarpentry.github.io/shell-extras/08-environment-variables.html
You can also modify the environment from within Python, using the
"os.environ"
Thanks! I presume this won't impact already running processes and is only
valid for as long as my instance of PuTTY is running and after that revert
to normal?
--
View this message in context:
I am trying to obtain the correlation histogram for a graph of mine following
the example given in the manual. I run:
g = gt.load_graph('graph.gt')
gt.remove_parallel_edges(g)
h=gt.corr_hist(g,'out','out')
My graph is relatively large at 12,238,931 vertices and 24,884,365 edges. My
problem is
