Re: [Boost-users] [graph] Search algorithm using quality metric rather than distance

From: Roger Leigh Can I also append .edge_map() here to get a map of edges?

No

I want to be able to access the edge linking each vertex v to its parent predecessor[v], so I can use the bundled properties. Or do I need to find it by hand / use some other Boost.Graph functionality I'm unaware of?

You can use the boost::edge(u,v,graph) function. auto edge_descriptor = boost::edge(predecessor[v], v, g).first;