Actually, the answer is "yes, if you do a little work". The adjacency_list is customizable, you can specify what kind of container it will use to store the out-edge lists for each vertex. If you choose a container type that sorts its elements (perhaps std::set or some sorted vector) then you will have what you need. The customization of adjacency_list is through the container_gen traits class. There's a little in the online docs and the book about this. If you get stuck let me know. Cheers, Jeremy --On Monday, May 6, 2002 11:03 AM +0100 Louis Lavery <Louis@devilsChimney.co.uk> wrote:
Hi,
Is it possible to order the edges of a vertex of a boost graph?
From what I can glean from the BGL documentation, I guess the answer will be "No, but may be some time in the future". I so, how soon in the future?
Thanks,
Louis.