Hi, I recently read the source code about the graph processing. I found that the edge information of a vertex is stored in ArrayList, which implicitly assume that the edges of a vertex can be fit in the memory. Will such implementation cause problem for some extreme large graphs?
I also read the source code of apache giraph, it seems that they have similar implementation (store the edges in an in-memory data structure). Regards, Yexi
