... | ... |
@@ -18,7 +18,7 @@ |
18 | 18 |
#' or remove certain annotations. |
19 | 19 |
#' |
20 | 20 |
#' NetPathMiner stores all its vertex annotation attributes in a list, and stores them collectively as |
21 |
-#' a single \code{attr}. This is not to interfer with \code{\link[igraph]{attributes}} from \code{igraph} package. |
|
21 |
+#' a single \code{attr}. This is not to interfer with \code{\link[igraph]{graph_attr_names}} from \code{igraph} package. |
|
22 | 22 |
#' All functions here target NetPathMiner annotations only. |
23 | 23 |
#' |
24 | 24 |
#' @param graph An annotated igraph object. |
... | ... |
@@ -261,7 +261,7 @@ fetchAttribute <- function(graph, organism="Homo sapiens", target.attr, source.a |
261 | 261 |
#' value (or \code{NA}). The default computes Pearson's correlation. |
262 | 262 |
#' @param complex.method A function, or a string indicating the name of the function to be used in weighting edges connecting complexes. |
263 | 263 |
#' If a vertex has >1 attribute value, all possible pairwise weights are first computed, and given to \code{complex.method}. The default |
264 |
-#' function is \code{\link[base]{max}}. |
|
264 |
+#' function is \code{\link[base:Extremes]{max}}. |
|
265 | 265 |
#' @param missing.method A function, or a string indicating the name of the function to be used in weighting edges when one of the vertices |
266 | 266 |
#' lack expression data. The function is passed all edge weights on the graph. Default is \code{\link[stats]{median}}. |
267 | 267 |
#' @param same.gene.penalty A numerical value to be assigned when 2 adjacent vertices have the same attribute value, since correlation and |
... | ... |
@@ -220,7 +220,7 @@ plotAllNetworks <- function(paths, metabolic.net=NULL, reaction.net=NULL, gene.n |
220 | 220 |
#' @param cluster.strength A number indicating tie strengths between vertices with the same attribute. |
221 | 221 |
#' The larger it is, the closer the vertices will be. |
222 | 222 |
#' @param layout A layout function, ideally a force-directed layout fuction, such as |
223 |
-#' \code{\link[igraph]{layout.fruchterman.reingold}} and \code{\link[igraph]{layout.kamada.kawai}}. |
|
223 |
+#' \code{\link[igraph]{layout_with_fr}} and \code{\link[igraph]{layout_with_kk}}. |
|
224 | 224 |
#' |
225 | 225 |
#' @return A two-column matrix indicating the x and y postions of vertices. |
226 | 226 |
#' |
... | ... |
@@ -25,7 +25,7 @@ value (or \code{NA}). The default computes Pearson's correlation.} |
25 | 25 |
|
26 | 26 |
\item{complex.method}{A function, or a string indicating the name of the function to be used in weighting edges connecting complexes. |
27 | 27 |
If a vertex has >1 attribute value, all possible pairwise weights are first computed, and given to \code{complex.method}. The default |
28 |
-function is \code{\link[base]{max}}.} |
|
28 |
+function is \code{\link[base:Extremes]{max}}.} |
|
29 | 29 |
|
30 | 30 |
\item{missing.method}{A function, or a string indicating the name of the function to be used in weighting edges when one of the vertices |
31 | 31 |
lack expression data. The function is passed all edge weights on the graph. Default is \code{\link[stats]{median}}.} |
... | ... |
@@ -46,7 +46,7 @@ All annotation attributes are exracted from \code{XRefs} associated with the ver |
46 | 46 |
MIRIAM guidelines (\code{miraim.db}, where db is the database name). |
47 | 47 |
} |
48 | 48 |
\examples{ |
49 |
-if(require(rBiopaxParser)){ |
|
49 |
+if(requireNamespace("rBiopaxParser")){ |
|
50 | 50 |
data(ex_biopax) |
51 | 51 |
# Process biopax as a metabolic network |
52 | 52 |
g <- biopax2igraph(ex_biopax) |
... | ... |
@@ -45,7 +45,7 @@ or remove certain annotations. |
45 | 45 |
} |
46 | 46 |
\details{ |
47 | 47 |
NetPathMiner stores all its vertex annotation attributes in a list, and stores them collectively as |
48 |
-a single \code{attr}. This is not to interfer with \code{\link[igraph]{attributes}} from \code{igraph} package. |
|
48 |
+a single \code{attr}. This is not to interfer with \code{\link[igraph]{graph_attr_names}} from \code{igraph} package. |
|
49 | 49 |
All functions here target NetPathMiner annotations only. |
50 | 50 |
} |
51 | 51 |
\examples{ |
... | ... |
@@ -29,7 +29,7 @@ common attributes (in the same pathway or compartment). |
29 | 29 |
|
30 | 30 |
# Integration with graphite package |
31 | 31 |
\dontrun{ |
32 |
- if(require(graphite) & require(clipper) & require(ALL)){ |
|
32 |
+ if(requireNamespace("graphite") & requireNamespace("clipper") & requireNamespace("ALL")){ |
|
33 | 33 |
genesetnets <- getGeneSetNetworks(ex_kgml_sig, |
34 | 34 |
use.attr="pathway", format="pathway-class") |
35 | 35 |
path <- convertIdentifiers(genesetnets$`Chemokine signaling pathway`, |
... | ... |
@@ -32,7 +32,7 @@ can be specified through \code{gene.attr} argument. |
32 | 32 |
# Write the genesets in a GMT file, and read it using GSEABase package. |
33 | 33 |
getGeneSets(ex_kgml_sig, use.attr="pathway", gene.attr="miriam.ncbigene", gmt.file="kgml.gmt") |
34 | 34 |
\dontrun{ |
35 |
- if(require(GSEABase)) |
|
35 |
+ if(requireNamespace("GSEABase")) |
|
36 | 36 |
toGmt("kgml.gmt") |
37 | 37 |
} |
38 | 38 |
|
... | ... |
@@ -16,7 +16,7 @@ layoutVertexByAttr(graph, attr.name, cluster.strength = 1, |
16 | 16 |
The larger it is, the closer the vertices will be.} |
17 | 17 |
|
18 | 18 |
\item{layout}{A layout function, ideally a force-directed layout fuction, such as |
19 |
-\code{\link[igraph]{layout.fruchterman.reingold}} and \code{\link[igraph]{layout.kamada.kawai}}.} |
|
19 |
+\code{\link[igraph]{layout_with_fr}} and \code{\link[igraph]{layout_with_kk}}.} |
|
20 | 20 |
} |
21 | 21 |
\value{ |
22 | 22 |
A two-column matrix indicating the x and y postions of vertices. |