GDS algorithms are run on an in-memory projected graph. The library provides helper procedures, which can be used to predict the memory usage required for storing a projected graph and running a given algorithm. These estimations are performed via the estimate execution mode, which can be appended to graph creation or algorithm execution procedures.





















































