On 2/12/07, Alejandro Marcos Aragón <aaragon2@uiuc.edu> wrote:
Hi everyone,
I posted this message but I haven't received any response so I decided to post it again. I am trying to store all the vertices with their respective distances from a source within the Dijkstra shortest path algorithm. For that I plan to use a std::vector<std::queue > >. I was able to have the visitor working but I don't know how to access to those values that are computed automatically by the algorithm (d_v, d_u, for example). The code I wrote is as follows:
Hi Alejandro, I'm not sure I understand your question - The distances from the source vertex are stored in the DistanceMap, and the shortest paths to the source vertex are stored in the PredecessorMap (I'm using the terminology from http://www.boost.org/libs/graph/doc/dijkstra_shortest_paths.html.) What do you want to store in a vector of queues, i.e. what would the ith queue represent? Regards, Aaron