There are functions to compute minimum or minimal vertex separators. Separators are vertex sets whose removal disconnects the graph (or increases the number of connected components). You may find these functions useful.
https://igraph.org/r/doc/min_st_separators.html https://igraph.org/r/doc/min_separators.html On Sat, 29 Dec 2018 at 11:47, Вадим Семенов <vadim.semeno...@gmail.com> wrote: > Dear igraph administrators, > > recently, I started to use the igraph and just fallen in love with this > tool. This is what I'm looking for =) Thank's for your job. > I'm writing to you for asking for advice about the most efficient way to > calculate how many nodes in the graph lost their connection with other > nodes if we delete some node. Just for now I have only brute force > solution: make a routine through all nodes and check g.are_connected(node1, > node2), then we delete some node and repeat the routine once again in order > to check node connection once again. I realize that my solution is > dramatically inefficient. Probably you could help me with a better approach. > I'm looking forward to your reply. > > -- > With regards, > Semenov Vadim. > _______________________________________________ > igraph-help mailing list > igraph-help@nongnu.org > https://lists.nongnu.org/mailman/listinfo/igraph-help >
_______________________________________________ igraph-help mailing list igraph-help@nongnu.org https://lists.nongnu.org/mailman/listinfo/igraph-help
