|
Boost Users : |
Subject: Re: [Boost-users] [BGL] dijkstra_shortest_paths with listS
From: gast128 (gast128_at_[hidden])
Date: 2010-01-07 16:11:27
> > 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.
Boost-users list run by williamkempf at hotmail.com, kalb at libertysoft.com, bjorn.karlsson at readsoft.com, gregod at cs.rpi.edu, wekempf at cox.net