Suitable data structure for large graphs

Question

I have a large graph, is there any other data structure other than adjacency list and "adjacency matrix" in c++ stl or some other data structure which I can employ for such a large graph, actually the adjacency matrix of my graph does not fit in the main memory. My graph is directed and I am implementing dijkstra algorithm in C++.

I have seen the previous posts...but I am searching for a suitable data structure with respect to dijkstra.

By large I mean a graph containing more than 100 million nodes and edges.

@DavidBrabant Thanks for replying.. I have defined – user1354510 May 29 '12 at 13:02 — user1354510, May 29 '12 at 13:02
There is a graph lib already in boost – Mr.Anubis May 29 '12 at 13:09 — Mr.Anubis, May 29 '12 at 13:09
@Mr.Anubis Yes, but it is exceptionally hard to use. – Hindol Jul 15 '12 at 11:58 — Hindol, Jul 15 '12 at 11:58

score 2 · Answer 1 · answered May 29 '12 at 13:56

2

It's common to represent adjacency lists as lists of integers, where the integer is the index of a node. How about getting some more space efficiency by instead treating the adjacency list as a bit string 00010111000... where a 1 in nth position represents an edge between this node and node n? Then compress the bitstring by some standard algorithm; uncompress it as you need it. The bit strings will probably compress pretty well, so this trades space efficiency for higher computational cost.

answered May 29 '12 at 13:56

gcbenison

10,617
3
39
72

Not a bad idea! I may need to use this at some point :). If he's using C++ though, a `std::bitset` might work better. – Richard J. Ross III May 29 '12 at 14:09
Ya..this is the same as adjacency matrix – user1354510 May 29 '12 at 15:16

Suitable data structure for large graphs

1 Answers1

Linked