CINNA (version 1.2.0)

giant_component_extract: Giant component extraction of a graph

Description

This function extracts the largest connected or the giant component of the input graph which can be an "igraph" object or a "network" object and convert them as "igraph" objects. For the bipartite graph, this will apply projection before extracting the components.

Usage

giant_component_extract(
  x,
  directed = TRUE,
  bipartite_proj = FALSE,
  num_proj = 1
)

Arguments

x

An igraph or a network object

directed

Whether to create a directed graph(default=TRUE)

bipartite_proj

Whether the bipartite network must be projected or not(default=FALSE)

num_proj

A number which shows the number of projects especifically for bipartite graphs.(default=1)

Value

a list contatining the giant componet of the input graph. The first element is an igraph object and the second is the edgelist of that.

Details

This function distinguishes the largest component of an "igraph" or a "network" object and illustrates them as a list which contains the edgelist of the giant component. If the input graph was bipartite and the "bipartite_proj" was TRUE, it will projet it and you can decide to which project you want to continue to work with that.

References

Newman, M. (2010). Networks. Oxford University Press.

See Also

induced.subgraph,clusters

Examples

# NOT RUN {
# a graph with 4 vertices

data(zachary)
giant_component_extract(zachary)

# }