> Sorry, for failing to explain clearly what to do. Attached follows a PDF that > shows exactly heuristic that wish to implement (section 4.2). Section 4.2 is about "real benchmark data", not some heuristic. I don't quite understand how it is related to your question. However, if you have an edge attribute named "distance" for each pair of connected vertices, you can simply get the sum of "distance" attributes for the edges incident on a specific vertex using the strength() function. (It is called graph.strength() in R, strength() in Python and igraph_strength() in C).
T. _______________________________________________ igraph-help mailing list [email protected] https://lists.nongnu.org/mailman/listinfo/igraph-help
