Hi Sam, On 8/28/07, Sam Peterson wrote:

I know that if I use a setS for the edgelist container for an adjacency_list class, each edge of my graph will only be added once as I build it.

This functionality is very desirable for me, but I've found I can't seem to use it with the equally desirable Bundled Property Maps. Specifically, this line of code doesn't seem to work:

(*g)[i].paper_id = atoi(row[0]);

g is a pointer to my graph. The exact compiler error with g++ 4.1.1 is:

error: invalid conversion from 'size_t' to 'void*'

An example would be very helpful, as the following compiles fine for me with boost 1.33.1 and g++ 4.1.2: Cheers, Stephan #include <iostream> #include struct Vertex{ }; struct Edge{ std::size_t paperid; }; int main() { using namespace boost; typedef adjacency_list Graph; typedef graph_traits<Graph>::edge_descriptor edge_descriptor; typedef graph_traits<Graph>::edge_iterator edge_iterator; Graph g; Graph* p_g = &g; std::pair p = add_edge(0,1, g); if(p.second){ g[p.first].paperid = 1; } else{ std::cout << "Could not insert edge" << std::endl; } edge_iterator it, end; for(tie(it, end) = edges(g); it != end; ++it){ std::cout << (*p_g)[*it].paperid <