Hi, > Given a complex graph can we input a list of specific edges to remove. Not with edge.betweenness.community() because the whole point of the edge betweenness community detection is to remove edges in decreasing order of their edge betweenness scores. However, you can of course simply remove edges from your graph manually, then check whether your 200 nodes are in the same connected component by running clusters() on the graph and comparing the membership indices of the nodes of interest (they should be the same if they are in the same connected component).
T. _______________________________________________ igraph-help mailing list [email protected] https://lists.nongnu.org/mailman/listinfo/igraph-help
