Re: [Boost-users] Boost Graph: edge indices

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, Trevor