涉及C ++中图形的大型测试用例（使用STL）抛出std :: bad_alloc

Question

We are working on a graph (stored as adjacency list implementation) algorithm implementation which requires us to store the following :

1. An 2-dimensional n into n matrix of distances (stored as an array of floats)
2. The number of shortest paths between every pair of vertices (stored as an array of integers).
3. The predecessors for every vertex taking a given vertex as a source vertex, for all possible choices of source. This is O(n*n*k) where k is the average number of predecessors for a all vertices over all possible choices of source vertex.In the worst case,this can be upto O(n^3) space. However the average number of predecessors is likely to be small.(k is a constant). Predecessor is stored as a two level map with the list of predecessors stored as a STL vector.

We tried testing on large graphs (>2^12 vertices) and this throws a std::bad_alloc after running for some time. This is the case even when run on 8GB(Ubuntu 12.04) or 16GB using only 3GB of memory. Could you tell how we can get large test cases to work or are we going wrong somewhere?

Answer 1

尝试在64位操作系统上以64位模式编译代码。