
1 Apr
2008
1 Apr
'08
4:09 p.m.
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.