[graph-tool] Fetch all the edges between given two vertices

[Snehal Shekatkar]

Dear all,





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



Best regards,
SMS
--
Snehal M. Shekatkar
https://inferred.in
PGP key -> https://inferred.in/snehal_pub_key.txt

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 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?

OpenPGP_0x1CC7AB23F89CAACF.asc
Description: OpenPGP public key

OpenPGP_signature
Description: OpenPGP digital signature

_______________________________________________
graph-tool mailing list -- graph-tool@skewed.de
To unsubscribe send an email to graph-tool-le...@skewed.de