C++ Storing large graph in Adjacency list efficiently?

I have an edge list of undirected graph

1 2
3 4
5 6

I need to perform Page rank using MPI on this graph Efficiency is of most importance.

My question is whats the most efficient way to read large graphs like this and store them in an adjacency list in C++. The said graph contain million nodes and even more edges.

链接地址: http://www.djcxy.com/p/52384.html

上一篇: 如何跨类使用TraceSource

下一篇: C ++高效地在邻接列表中存储大图？