[Boost-users] [Boost.Graph] Accessing edge properties via an edge_iterator

Subject: [Boost-users] [Boost.Graph] Accessing edge properties via an edge_iterator
From: Julius Ziegler (ziegler_at_[hidden])
Date: 2008-12-08 13:40:16

Hello list,

I wonder what is the fastest method to access edge properties of an 
adjacency_list when iterating over edges. Actually, the only way I know 
of for accessing properties is via operator[]:

typedef boost::adjacency_list<listS, vecS, boost::directedS, 
NodeProperty, EdgeProperty > Graph;

Graph g;

for( tie( ei, ei_end ) = edges( graph ); ei != ei_end; ++ei )
{
    g[*ei]=something;
}

 From this I conclude, that the right EdgeProperty is stored in some 
associative container, with edge_descriptor being the key-type. Or does 
edge_iterator store any information besides a pair<vertex_descriptor, 
vertex_descriptor>? What is the time complexity of this look_up?

To me it feels that there should be a faster way to access properties 
via an edge_iterator, and by browsing the source I found that 
edge_iterator has a member function get_property(), however, since it 
returns void*, and I did not find anything in the documentation, I'm not 
  sure if it is there for this purpose.

Thank you very kindly for any hints,

Julius