|
Boost Users : |
From: Ioannis Nousias (s0238762_at_[hidden])
Date: 2008-04-01 12:09:52
Hello,
I'm using dijkstra_shortest_paths() in a multi-graph, which seems to
work fine. Via the predecessor map I get the vertices in the shortest
path. However, how do I get the edges of the shortest path, bearing in
mind this is a multi-graph (has parallel edges)?
thanks
Ioannis
PS: is this the right mailing list to ask these sort of questions ?
-- The University of Edinburgh is a charitable body, registered in Scotland, with registration number SC005336.
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