Re: [Boost-users] [BGL] obtaining list of edges in a shortest path

From: Doug Gregor (dgregor_at_[hidden])
Date: 2006-02-27 10:01:02

On Feb 26, 2006, at 7:19 PM, Lars S. Jessen wrote:
> As you can see, it's easy to obtain the list of vertices that makes the
> shortest path from start to goal, but how do I obtain the list of edges
> connecting start to goal?

Since you have the predecessor "u" for each vertex "v" in your 
predecessor map, use the "edge(u, v, g)" function to retrieve the edge 
from u to v. If your graph has parallel edges, search the out-edges of 
u to find the edge (u, v) with smallest weight.

        Doug