Yes, it is, I believe: http://igraph.sourceforge.net/doc/R/biconnected.components.html
Gabor On Mon, Oct 29, 2012 at 8:45 AM, Moses Boudourides <[email protected]> wrote: > Hi, > > Is it possible to find the block graph of a given graph using igraph? > By block it is meant a maximal inseparable subgraph (inseparable = > without cut vertices). > > --Moses > > _______________________________________________ > igraph-help mailing list > [email protected] > https://lists.nongnu.org/mailman/listinfo/igraph-help -- Gabor Csardi <[email protected]> MTA KFKI RMKI _______________________________________________ igraph-help mailing list [email protected] https://lists.nongnu.org/mailman/listinfo/igraph-help
