getLargestSubgraph: A function to extract the largest subgraph from a graphNEL...

In QuACN: QuACN: Quantitative Analysis of Complex Networks

Description

In QuACN most methods depend on the analyzed graph to be connected. This function extracts the largest connected component from a graphNEL object.

Usage

getLargestSubgraph(g)

Arguments

g	A graphNEL object of which the largest connected component has to be extracted.

Value

The largest connected graphNEL object from g

Note

Code taken from Hahne et al. "Bioconductor Case Studies"

Author(s)

Karl Kugler

References

Florian Hahne, Wolfgang Huber, Robert Gentleman, Seth Falcon "Bioconductor Case Studies", Springer, 2008

Examples

set.seed(667)
g <- randomGraph(paste("A",1:100, sep=""), 1:4, p=0.03, weights=FALSE)
lcc <- getLargestSubgraph(g)
lcc

QuACN documentation built on May 2, 2019, 5:46 p.m.