On Thu, 1 Apr 2010, Gábor Szuromi wrote:

Hi!

The edge_index internal property map is not created by default, so you have to define it explicitly:

typedef adjacency_list > MyGraph; typedef property_map::type MyEdgeIndexMap; ... // Retrieve the edge index map associated with the graph MyEdgeIndexMap emap = get(edge_index, g); ... // Convert the edge descriptor to an integer value cout << index[ get(emap, e, g) ] << endl;

Note that you need to fill in the edge indices; they are not created automatically for the graph type you have.

The vertex descriptor is an integer value so it works with operator[], but edge descriptor is an std::pair<>, so you have to convert it to an integer with the appropriate edge index map. This leaves only one question: how do you use bundled edge properties along with edge index map?

You don't need an edge index map for bundled edge properties. Your graph doesn't currently have (from what is listed above) bundled edge properties; if it did, you could do just g[e].whatever where "whatever" is a member of your bundled edge property class. -- Jeremiah Willcock

On Thu, 1 Apr 2010, Trevor Harmon wrote:

On Apr 1, 2010, at 6:40 AM, Jeremiah Willcock wrote:

...

Note that you need to fill in the edge indices; they are not created automatically for the graph type you have.

Which graph type would automatically create them? Thanks,

compressed_sparse_row_graph if you are willing to live with read-only access to the graph structure (properties are still read-write). Some of the generators like grid_graph have edge_index built in as well. The normal mutable graph types don't have them as far as I know, though. -- Jeremiah Willcock

On Thu, 1 Apr 2010, Trevor Harmon wrote:

On Apr 1, 2010, at 6:40 AM, Jeremiah Willcock wrote:

...

Note that you need to fill in the edge indices

Okay, so whenever I add an edge I need to assign it a unique index myself. Here's how I'm doing it for the initial construction of the graph:

size_t edgeIndex = 0; for (...) { Vertex u = ... Vertex v = ... Edge edge; bool inserted; tie(edge, inserted) = add_edge(u, v, g); EdgeIndexMap edgeIndexMap = get(edge_index, g); put(edgeIndexMap, edge, edgeIndex++); }

Does that look right? It seems to work, but I'm wondering if it's the best way.

That's fine, but you don't need to fetch edgeIndexMap every time -- you can get it outside the loop then use it repeatedly. You can also create the edges without filling in the edge indices then do a loop over edges(g) to fill them all in at once. -- Jeremiah Willcock

On Thu, 1 Apr 2010, Trevor Harmon wrote:

On Apr 1, 2010, at 5:31 AM, Gábor Szuromi wrote:

...

The edge_index internal property map is not created by default, so you have to define it explicitly:

Any particular reason why vertex indices are created (and updated) by default but edge indices are not? Perhaps it was just decided that the former is often needed while the latter not so often...

Vertex indices are an accident of using a vector as the vertex container -- see another email I posted today about that.

...

typedef adjacency_list > MyGraph; typedef property_map::type MyEdgeIndexMap; ... // Retrieve the edge index map associated with the graph MyEdgeIndexMap emap = get(edge_index, g); ... // Convert the edge descriptor to an integer value cout << index[ get(emap, e, g) ] << endl;

Thanks for the tip. However, I think that last line is wrong. It should be:

cout << index[ get(emap, e) ] << endl;

Yes, you can do either get(emap, e) or get(edge_index, g, e). -- Jeremiah Willcock

On Fri, 2 Apr 2010, Trevor Harmon wrote:

On Apr 1, 2010, at 5:31 AM, Gábor Szuromi wrote:

...

The edge_index internal property map is not created by default, so you have to define it explicitly:

typedef adjacency_list > MyGraph; typedef property_map::type MyEdgeIndexMap; ... // Retrieve the edge index map associated with the graph MyEdgeIndexMap emap = get(edge_index, g); ... // Convert the edge descriptor to an integer value cout << index[ get(emap, e, g) ] << endl;

A follow-up question, if I may... It seems like an awful lot of setup is required just to iterate through the edge indices. For example, here's what I'm doing now:

typedef property_map::type IndexMap; IndexMap index = get(vertex_index, g); typedef graph_traits<MyGraph>::edge_iterator edge_iter; std::pair ep; EdgeIndexMap edgeIndexMap = get(edge_index, g); for (ep = edges(g); ep.first != ep.second; ++ep.first) { Edge edge = *ep.first; cout << index[get(edgeIndexMap, edge)] + " "; }

Is there any way to simplify the above code? That's a lot of typing for such a basic task... Thanks,

#include EdgeIndexMap edgeIndexMap = get(edge_index, g); BGL_FORALL_EDGES(edge, g, MyGraph) { cout << index[get(edgeIndexMap, edge)] + " "; } or (I think) #include EdgeIndexMap edgeIndexMap = get(edge_index, g); BOOST_FOREACH (graph_traits<MyGraph>::edge_descriptor edge, edges(g)) { cout << index[get(edgeIndexMap, edge)] + " "; } -- Jeremiah Willcock