connectedComp {RBGL} | R Documentation |
The connected components in an undirected graph are identified. If the graph is directed then the weakly connected components are identified.
connectedComp(g)
g |
g: graph with edgemode “undirected” |
Uses a depth first search (dfs) approach to identifying all the connected
components of an undirected graph. If the input, g
, is a directed
graph it is first transformed to an undirected graph (using
ugraph
). The
mathematical formalism involved can be
found in graph package or in any good book on graph theory.
A list of length equal to the number of connected components in
g
. Each element of the list contains a vector of the node
labels for the nodes that are connected.
Vince Carey <stvjc@channing.harvard.edu>
Boost Graph Library
km <- fromGXL(file(system.file("GXL/kmstEx.gxl",package="graph"))) km@nodes <- c(km@nodes,"F","G","H") km@edgeL$F <- list(edges=numeric(0)) km@edgeL$G <- list(edges=8) km@edgeL$H <- list(edges=7) ukm <- ugraph(km) ukm edges(ukm) connectedComp(ukm)