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

Hello Jakub, the search data returned by DFS (via the visitor callbacks) only asserts the existence of edges in the graph and is by definition not dependent on edge properties. How about creating a new algorithm that's based on the DFS code? That seems much simpler than running through the DFS and correlating with edge weights in the context of the visitor. Hope this helps - Chris "Jakub Plichta" wrote in message news:818EBD12B8346646AB8DE851CA2FE816019E0DCD@us1-mail2... 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]