Subject: Re: [boost] [graph] out_edges sort
From: Jeremiah Willcock (jewillco_at_[hidden])
Date: 2010-09-09 14:46:17
On Thu, 9 Sep 2010, fabien.castan_at_[hidden] wrote:
>> There is no way to do a sort in place ?
>>> Not using the "official" interfaces, AFAIK. What are you trying to do?
>>> Maybe there's a different algorithm in BGL that might do what you want.
> I compute some values on each node, depending on connected vertices, etc.
> Next I need to visit my graph in a dfs but going first into out_edges with the biggest precomputed value.
Could this be phrased as an A* search? That isn't quite the same, since
the search is not depth-first (it's effectively uniform-cost based on a
heuristic), but it could be appropriate. I do not see anything in BGL
that's exactly what you want -- I think you might want to copy-and-paste
the DFS code to use your out-edge ordering, or accept some kind of
uniform-cost search that isn't depth-first.
-- Jeremiah Willcock
Boost list run by bdawes at acm.org, david.abrahams at rcn.com, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk