|
Boost Users : |
From: Giulio Veronesi (giulio_veronesi_at_[hidden])
Date: 2005-09-21 07:17:30
I'd like to specify better my problem. I'd like to use an
edge_descriptor (graph_traits<G>::edge_descriptor) as key in a map. The
graph type is something like this:
typedef adjacency_list<vecS, vecS, bidirectionalS,
no_property, MyStuff> G;
I think that I've to overload the < operator for
graph_traits<G>::edge_descriptor. Is this correct? If so, given two
edge_descriptors I need to access the source and the target of the edge
in such a way to define a sort ordering.
Thanks,
Giulio
Boost-users list run by williamkempf at hotmail.com, kalb at libertysoft.com, bjorn.karlsson at readsoft.com, gregod at cs.rpi.edu, wekempf at cox.net