Boost Users :
Subject: Re: [Boost-users] [BGL] dijkstra_shortest_paths on dynamically growing and shrinking graphs
From: Andrew Sutton (andrew.n.sutton_at_[hidden])
Date: 2009-05-26 08:37:15
> My problem is, that the dijkstra_shortest_paths method dosen't work when I
> provide a plain std::vector to the distance_map() and predecessor_map()
> parameter of the dijkstra_shortest_paths call because of the mapping from
> the vertex descriptor to position in the vector.
> Can anybody tell me how to provide the "right" type of parameter for
> distance_map() and predecessor_map() ?
What do you mean be "doesn't work?" It looks like it should be okay (outside
of the fact that removing vertices when VertexList == vecS is a O(|V|)
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