I'm using boost::graph
and I have two vertex_descriptor
s. What is the quickest way to get the edge between them, without iterating over all the edges?
Ok, I found it out. boost::edge(u,v,g)
returns pair<edge_descriptor, bool>
where the bool
is whether the edge exists. So in my case I know it does, so I use the expression:
boost::edge(u,v,g).first