on Wed Jul 09 2008, Mojmir Svoboda wrote:

* Zeljko Vrba [2008-07-08 10:02:27 +0200]:

...

std::vector<EdgeIndex> m_rowstart; std::vector<Vertex> m_column;

I already have a graph stored as a BGL adjacency_list and now I want to use a 3rd-party library (SCOTCH) which takes its input also in the CSR format. As I can see from the docs, there is no standardized interface to retrieve the raw CSR representation.

i second that! :) moreover i'd like to customize the underlying containers (std::vector) at least with my own allocator.

If you have to deal with a non-generic 3rd party library, the solution is to build a CSR representation that's compatible with SCOTCH and then adapt it for use by BGL by defining the necessary things to make it conform to the necessary graph concepts. You could take a look at http://www.stanford.edu/~dgleich/programs/matlab_bgl/ for an example of exactly that approach. HTH, -- Dave Abrahams BoostPro Computing http://www.boostpro.com

hello - i have another question on CST: on construction of CSR from another graph - what happens when you construct csr directed graph from undirected adjacency_list? it doubles all edges? because i'm getting some crashes that tries to write past container boundary: in compressed_sparse_row_graph.hpp template void assign(const Graph& g, const VertexIndexMap& vi, vertices_size_type numverts, edges_size_type numedges) { m_column.resize(numedges); ////////// numedges = 1000 undirected edges for (Vertex i = 0; i != numverts; ++i) { m_rowstart[i] = current_edge; g_vertex v = vertex(i, g); EdgeIndex num_edges_before_this_vertex = current_edge; g_out_edge_iter ei, ei_end; for (tie(ei, ei_end) = out_edges(v, g); ei != ei_end; ++ei) { m_column[current_edge++] = get(vi, target(*ei, g)); } ////////// current edge is in range <0, 2000> seems like bug to me... is it? many thanks for your attention, mojmir