Subject: Re: [boost] boost graph.
From: Jeremiah Willcock (jewillco_at_[hidden])
Date: 2010-07-21 13:00:26
On Wed, 21 Jul 2010, Giorgio Zoppi wrote:
> I've a problem with multiple links on the same vertexes.
> For example we've vertex A and vertex B and we want identify two
> different edges that they connects to these edges, i.e.
> A-->B with cost 6
> A-->B with cost 8
> Is there any way to tag or label these links and using the dijkstra
> algorithm on the graph?
You want predecessor edges, not predecessor vertices, I assume. You
should use the (undocumented) edge_predecessor_recorder visitor (and the
record_edge_predecessors() function) instead of predecessor_recorder.
-- Jeremiah Willcock
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk