mst.plot.mod {netbiov} | R Documentation

## Network plot

### Description

Global layout style:

Large complex networks can be plotted using the fruchterman-reingold algorithm, the Kamada-kawai algorithm or any given input function by applying these algorithms to the minimum spanning tree (MST). The edges of the minimum spanning tree are shown in black, all other edges are shown in colors which are a function of the distances between the coordinates of the nodes.

### Usage

     mst.plot.mod(x, layout.function=NULL,colors=NULL,
    mst.edge.col="white", vertex.color = "skyblue",
    tkplot=FALSE,expression=NULL, v.size=FALSE, e.size=FALSE,
    mst.e.size=1, edge.col.wt=NULL, v.lab=FALSE, e.lab=NULL,
    bg="black",v.lab.cex=0.5, e.lab.cex=0.5,v.lab.col="blue",
    lab.dist=0, e.lab.col="blue",v.sf=c(3,12), sf=0,
    e.arrow=.2, layout.overall=NULL)

### Arguments

`x` | `x` is a graph object, created using the igraph package.
`layout.function` | `layout.function` is a function class. The user can pass his own function to plot the graph. The input function passed to `layout.function` should return a 2D matrix of coordinates with rows equal to the number of vertices of the input graph and two columns representing x and y coordinates.
`layout.overall` | `layout.overall` is a function class. The user can pass his own function to adjust the abstract view of the graph. The input function passed to `layout.overall` should return a 2D coordinate matrix containing two columns and the number of rows equals the number of vertices in the input network. The user defined function should return a 2D matrix of coordinates with rows equal to the number of vertices of the input graph and two columns representing x and y coordinates.
`mst.edge.col` | This option assigns a color to the edges of the minimum spanning tree of graph 'g'. If mst.edge.col = NULL, then the default color is black for 'tkplot=TRUE'. If 'tkplot=FALSE' it is white.
`colors` | `colors` is a vector for the edge colors of the remaining edges in a graph. These remaining edges are colored based on the distance between the nodes connecting them.
`vertex.color` | `vertex.colors` is a vector of colors for the vertices of a graph.
`expression` | `expression` is a numeric vector which represents properties of genes or proteins, e.g., their mean expression values or p-values. If this option is given, the nodes are colored with a range of colors from red to blue (red for low expression, blue for high expression) depending on the expression values.
`tkplot` | `tkplot` is a boolean variable. If it is FALSE, the graph is plotted with the plot function with a black background.
`v.size` | is a numeric value or a numeric vector which contains values to assign the size of the nodes.
`e.size` | is a numeric value or a numeric vector which contains values to assign the width of edgesother than the minimum spanning tree edges of the graph.
`mst.e.size` | is a numeric value which assigns the edge width to the edges of minimum spanning tree of the input graph.
`v.lab` | is a logical value to show vertex label.
`e.lab` | is logical value to show edge labels.
`bg` | is a character value to color the background.
`v.lab.cex` | is a numerical value to set the font size of the vertex labels.
`e.lab.cex` | is a numerical value to set the font size of the edge labels.
`lab.dist` | is a numerical value to adjust the distance of labels from the nodes.
`v.lab.col` | is a hexadecimal value or a character name of a color to assign colors to the vertex labels.
`e.lab.col` | is a hexadecimal character value to assign colors to the edge labels.
`e.arrow` | is a inumerical value to set the arrow width in a directed network.
`v.sf` | is a 2 dimensional numeric vector, which represents the minimum and maximum limits of the size of the vertices. This is used to adjust the vertex size when the option `v.size` is used as a vector.
`sf` | is a numeric value. It is a scaling factor used to scale-up or scale-down the abstract graph.
`edge.col.wt` | is a vector of numeric values provided for each edge. This is used to color the edges from blue to red from high to low values.
`...` | `...` parameter for other inputs.

### Value

This function plots the graph object given as an input using 'tkplot' or 'plot' function available in 'igraph' package. This function returns a `netbiov` class object.

### Examples

      ## Example 1 ####
      g <- barabasi.game(2000, directed=FALSE)
      id <- mst.plot.mod(g)

      ## Example 2 ####
      ### plotting a graph by combining two algorithms ##%

      fn <- function(g){layout.reingold.tilford(g,
    circular=TRUE, root=which.max(degree(g)))}
      id <- mst.plot.mod(g, v.size=1, sf=-20, layout.function=fn,
    layout.overall=layout.fruchterman.reingold, mst.e.size=2,
    vertex.color="darkgreen")

      data("PPI_Athalina")
      id <- mst.plot.mod(g1, v.size=1, sf=0, layout.function=fn,
    layout.overall=layout.fruchterman.reingold, mst.e.size=1,
    vertex.color="magenta", colors=heat.colors(20))

      ## Example 3 ####
      ## When expression values of genes or nodes
    ## are given and to be plotted as a color of vertices ###
      id <- mst.plot.mod(g1, expression=rnorm(vcount(g1)), v.size=1)

      ## Example 4 ####
      ## When expression values of genes or nodes are given
    ## and to be plotted as a color of vertices,
    ## also the degree of nodes to be shown as their vertex-size ###
      id <- mst.plot.mod(g1, expression=rnorm(vcount(g1)),
    v.size=degree(g1), v.sf=c(1,5))

      ## Example 5 ####
      ## When MST edges are highlighted in purple color and rest
    ## of the edges are plotted with a range of heat colors
    ## depending on the distance between nodes ###
      id <- mst.plot.mod(g1, mst.edge.col="purple",
    colors=heat.colors(20), vertex.color="yellow", v.size=1)

      ## Example 6 ####
      ## Plotting a graph with kamada-kawai layout algorithm ###
      id <- mst.plot.mod(g1, mst.edge.col="purple",
    colors=heat.colors(20), vertex.color="white", v.size=1,
    layout.function=layout.kamada.kawai)

      ## Example 7 ####
      ## Plotting a graph with when weights of edges are given ###
      id <- mst.plot.mod(g1, mst.edge.col="purple", edge.col.wt =
    runif(ecount(g1), min=1, max=10), vertex.color="yellow", v.size=
    1, layout.function=layout.kamada.kawai)

[Package netbiov version 1.26.0 Index]