biconnected.components

0th

Percentile

Biconnected components

Finding the biconnected components of a graph

Keywords
graphs
Usage
biconnected.components(graph)
Arguments
graph
The input graph. It is treated as an undirected graph, even if it is directed.
Details

A graph is biconnected if the removal of any single vertex (and its adjacent edges) does not disconnect it.

A biconnected component of a graph is a maximal biconnected subgraph of it. The biconnected components of a graph can be given by the partition of its edges: every edge is a member of exactly one biconnected component. Note that this is not true for vertices: the same vertex can be part of many biconnected components.

Value

  • A named list with three components:
  • noNumeric scalar, an integer giving the number of biconnected components in the graph.
  • tree_edgesThe components themselves, a list of numeric vectors. Each vector is a set of edge ids giving the edges in a biconnected component. These edges define a spanning tree of the component.
  • component_edgesA list of numeric vectors. It gives all edges in the components.
  • componentsA list of numeric vectors, the vertices of the components.
  • articulation_pointsThe articulation points of the graph. See articulation.points.

concept

Biconnected component

See Also

articulation.points, clusters, is.connected, vertex.connectivity

Aliases
  • biconnected.components
Examples
g <- graph.disjoint.union( graph.full(5), graph.full(5) )
clu <- clusters(g)$membership
g <- add.edges(g, c(which(clu==1), which(clu==2)))
bc <- biconnected.components(g)
Documentation reproduced from package igraph, version 0.6.5-2, License: GPL (>= 2)

Community examples

Looks like there are no examples yet.