mergeGraphs            package:KEGGgraph            R Documentation

_A _f_u_n_c_t_i_o_n _t_o _m_e_r_g_e _K_E_G_G _g_r_a_p_h_s

_D_e_s_c_r_i_p_t_i_o_n:

     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'.

_U_s_a_g_e:

     mergeGraphs(list, edgemode = "directed")

_A_r_g_u_m_e_n_t_s:

    list: A list of graph objects, which can be created by
          'parseKGML2Graph' 

edgemode: Edge mode of the graph product, by default 'directed' 

_D_e_t_a_i_l_s:

     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.

_V_a_l_u_e:

     A directed graph

_N_o_t_e:

     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.

_A_u_t_h_o_r(_s):

     Jitao David Zhang <j.zhang@dkfz.de>

_S_e_e _A_l_s_o:

     'parseKGML2Graph'

