|
Boost Users : |
From: Jakub Plichta (jplichta_at_[hidden])
Date: 2002-10-09 19:56:34
Hello
I am using an adjacency list graph. During a dfs traversal I would like to
be control the order of edge traversal. Specifically I have an edge property
with an index value and I would like to traverse the higher index edges
first.
I have tried getting the out_edges iterator and resorting the edges base on
their index but that does not seem to make any difference.
Any suggestions would be very greatly appreciated.
Thanks
Jakub Plichta
[Non-text portions of this message have been removed]
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