|
Boost-Build : |
From: David Abrahams (dave_at_[hidden])
Date: 2003-03-14 05:44:01
Jeff Holle <jeff.holle_at_[hidden]> writes:
> What is the relationship between an "edge_descriptor" and what an
> edge_iterator dereferences?
The identity.
> I'm having problems coding the following:
>
>
> myFunct(GraphT& g)
> {
> typedef graph_traits<GraphT>::edge_descriptor Edge;
> typedef map< Edge, Edge_Datum> Edge_Data;
> Edge_Data edge_data;
> graph_traits<GraphT>::edge_iterator ei, ei_end;
> for(tie(ei,ei_end)=edges(graph);ei!=ei_end;++ei)
> edge_data.insert( make_pair(*ei, Edge_Data())); << blows up here.
> }
Your problem is the other half of the pair:
edge_data.insert( make_pair(*ei, Edge_Datum()));
^^^^^^^^^^
-- Dave Abrahams Boost Consulting www.boost-consulting.com
Boost-Build list run by bdawes at acm.org, david.abrahams at rcn.com, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk