A large complex network is plotted by splitting it into its modules. The positions of the vertices in each subnetwork are determined by using the fruchterman-reingold algorithm or the Kamada-kawai algorithm for the minimum spanning tree of each subnetwork. The edges of the minimum spanning tree are shown in black color.
splitg.mst(x,layout.function=NULL, mod.list=NULL,
colors=NULL,mst.edge.col="white",
vertex.color = c("red","green","blue","orange"),
random.v.color=FALSE,in.con.ed.col=NULL,tkplot=FALSE,
v.size=2, e.size=.5, mst.e.size=1, v.lab=FALSE,
bg="black", v.lab.cex=0.5, e.lab.cex=0.5,
v.lab.col="skyblue", lab.dist=0, v.sf=4, sf.modules = 5, ...)
x
is a graph object, created using igraph package. mod.list
is a list object, which provides a modular information about the graph, each components of mod.list contains a vector of nodes to be plotted.
v.size
input is a numeric vector. random
is a logical value, this option is used to choose nodes of split graphs randomly colors
is a vector of colors. This option is a vector of the edge colors to assign colors to the edges of the graph.vertex.colors
is a vector of colors to assign colors to the vertices of the modules of the graph.v.size
input is a numeric vector....
parameter for other inputs. data("PPI_Athalina")
data("modules_PPI_Athalina")
id <- splitg.mst(g1, mod.list=lm, random.v.color=TRUE, tkplot=FALSE )
Run the code above in your browser using DataLab