Re: [igraph] Memory limits

[Anselmo Garcia Cantu Ros]

Hello Gabor, 

Thank you. We have decided to explore the implementation of memory-mapped 
files to dealing with the problem of memory limits. 

Best regards, 

Anselmo 


Gábor Csárdi writes: 

> igraph is optimized for sparse networks, if you have an almost full
> graph, you might as well just use an adjacency matrix. 
>
> To gain memory, you can load the edge attributes into memory only when
> they are needed. 
>
> If you use R, then you might write to the R help mailing list about
> memory tips in general. 
>
> Gabor 
>
> On Tue, Aug 16, 2011 at 11:33 AM, Anselmo Garcia Cantu Ros
> <address@hidden> wrote:
> > Hi all,
> > We are dealing with a network which is almost fully connected with an edge
> > attribute list, we need to address sizes greater  than 10^4. Is there a mean
> > to overcome memory limits?.
> > All the best and thank you,
> > Anselmo 
> >
> > _______________________________________________
> > igraph-help mailing list
> > address@hidden
> > https://lists.nongnu.org/mailman/listinfo/igraph-help 
>  
>
>
> --
> Gabor Csardi <address@hidden>     MTA KFKI RMKI 
>
> _______________________________________________
> igraph-help mailing list
> address@hidden
> https://lists.nongnu.org/mailman/listinfo/igraph-help