mergeGraphs: A function to merge KEGG graphs
In KEGGgraph: KEGGgraph: A graph approach to KEGG PATHWAY in R and Bioconductor
Description
Usage
Arguments
Details
Value
Note
Author(s)
See Also
Description
The function merges a list of KEGG graphs into one graph object. The
merged graph have unique nodes, and edges are merged into
non-duplicate sets.
For the reason of speed, mergeGraphs discards KEGG node and
edge informations. To maintain them while merging graphs, please use mergeKEGGgraphs.
Usage
1
mergeGraphs(list, edgemode = "directed")
Arguments
list
A list of graph objects, which can be created by parseKGML2Graph
edgemode
Edge mode of the graph product, by default 'directed'
Details
The function takes a list of graphs and merges them into a new
graph. The nodes of individual graphs must be unique. The function
takes care of the removal of duplicated edges.
Value
A directed graph
Note
It is known that graphs from C.elegance pathways have
problem when merging, because the nodes name are not consistent betweeen
edge records and entry IDs.
Author(s)
Jitao David Zhang <jitao_david.zhang@roche.com>
See Also
KEGGgraph documentation built on Nov. 8, 2020, 5:42 p.m.
R Package Documentation
Browse R Packages
We want your feedback!
Note that we can't provide technical support on individual packages. You should contact the package authors for that.
Description Usage Arguments Details Value Note Author(s) See Also
Description
The function merges a list of KEGG graphs into one graph object. The merged graph have unique nodes, and edges are merged into non-duplicate sets.
For the reason of speed, mergeGraphs discards KEGG node and
edge informations. To maintain them while merging graphs, please use mergeKEGGgraphs.
Usage
1 | mergeGraphs(list, edgemode = "directed")
|
Arguments
list |
A list of graph objects, which can be created by |
edgemode |
Edge mode of the graph product, by default 'directed' |
Details
The function takes a list of graphs and merges them into a new graph. The nodes of individual graphs must be unique. The function takes care of the removal of duplicated edges.
Value
A directed graph
Note
It is known that graphs from C.elegance pathways have problem when merging, because the nodes name are not consistent betweeen edge records and entry IDs.
Author(s)
Jitao David Zhang <jitao_david.zhang@roche.com>
See Also
R Package Documentation
Browse R Packages
We want your feedback!
Note that we can't provide technical support on individual packages. You should contact the package authors for that.
Embedding an R snippet on your website
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.