
9 Oct
2002
9 Oct
'02
6:56 p.m.
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]