Trivial Description
Currently, at some places in the core code-base, graph statistics (number of vertices and number of edges) are being obtained by loading the entire partition and then putting it back. Although this is a correct way, it is not efficient (for instance for out-of-core computation), and concise (in terms of semantics).
