mergeGraphs {KEGGgraph} | R Documentation

## A function to merge KEGG graphs

### 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

    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 <j.zhang@dkfz.de>

### See Also

`parseKGML2Graph`

[Package KEGGgraph version 1.1.0 Index]