Re: [Boost-users] [Graph] Static allocation of nodes and edges

Subject: Re: [Boost-users] [Graph] Static allocation of nodes and edges
From: Sensei (senseiwa_at_[hidden])
Date: 2013-11-08 10:44:37

On 11/8/13, 3:15pm, Jeremiah Willcock wrote:
> If you have so few edges per vertex, you definitely don't want to use an
> adjacency matrix.  If your graph will be read-only (in terms of
> structure, not properties), use compressed_sparse_row_graph; be sure to
> change the vertex and edge count sizes to uint32_t if you know your
> graph size will fit into that.  If you are going to be doing
> modifications, use adjacency_list instead.  Adjacency matrices use N^2
> storage for N vertices, regardless of the number of edges, so they are
> unlikely to fit into memory for your problem size.

Actually, I would create at run-time a (huge) graph, and after that it 
will be read-only. The construction will have a constant nnumber of 
nodes (so I can use this in the constructor), while edges must be 
calculated at run-time, and I don't see any facility for doing this.

So I think I'm out of luck: I'm bound to the adjacency_list. Am I right?

Cheers & Thanks!