Re: [Boost-users] [BGL] dijkstra_shortest_paths with listS

Subject: Re: [Boost-users] [BGL] dijkstra_shortest_paths with listS
From: Jeremiah Willcock (jewillco_at_[hidden])
Date: 2010-01-07 16:46:57

On Thu, 7 Jan 2010, gast128 wrote:

>>> The weight of an edge is probably also a candidate to put in the graph
> instead
>>> of keeping it external. That is the next challenge.
>>
>> What do you mean by that?  What is the challenge you are having?
>
> I haven't spend time on it yet, but I was thinking using bundled properties to
> put weight for edges, and somehow one must use an adaptor for the
> dijkstra_shortest_path algorithm.

I don't think you need an adaptor.  You can have the edge weight as a 
member in the property bundle and then use boost::get(&EdgeProps::weight, 
g) to get a property map for it.  Is there something else you might need 
to adapt?

-- Jeremiah Willcock