The Graph Data Science library has been built for big datasets; graph representation and algorithms are optimized for big graphs. However, for efficiency's sake, all operations are performed in the heap, which is the reason why having an estimation of the memory requirements to run a given algorithm on a given projected graph can be important.





















































