Dear all,

I am analyzing a multigraph and I would like to fetch all the edges

between given two vertices during runtime. I haven't been able to figure

out an easy way to do this. For now, there are two possible ways:

1. Iterate over all the edges and catch the ones which connect vertices

u and v

2. Go through all the neighbours of u and find out all the occurrences of v

Both these operations, especially the first one, is expensive. Also,

`g.edge(u,v)` seems to return only one edge without any information

about which one it is. How can I solve this problem?

Best regards,

SMS