isomorphism               package:RBGL               R Documentation

_C_o_m_p_u_t_e _i_s_o_m_o_r_p_h_i_s_m _f_r_o_m _v_e_r_t_i_c_e_s _i_n _o_n_e _g_r_a_p_h _t_o _t_h_o_s_e _i_n _a_n_o_t_h_e_r _g_r_a_p_h

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

     Compute isomorphism from vertices in one graph to those in another
     graph

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

     isomorphism(g1, g2)

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

      g1: one instance of the 'graph' class 

      g2: one instance of the 'graph' class 

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

     As stated in documentation on isomorphism in Boost Graph Library:
     An isomorphism is a 1-to-1 mapping of the vertices in one graph to
     the vertices  of another graph such that adjacency is preserved.
     Another words, given graphs  G1 = (V1,E1) and G2 = (V2,E2) an
     isomorphism is a function f such that for all  pairs of vertices
     a,b in V1, edge (a,b) is in E1 if and only if edge (f(a),f(b)) is
     in E2.

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

     Output is true if there exists an isomorphism between g1 and g2,
     otherwise it's false.

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

     Li Long <li.long@isb-sib.ch>

_R_e_f_e_r_e_n_c_e_s:

     Boost Graph Library ( www.boost.org/libs/graph/doc/index.html )

     The Boost Graph Library: User Guide and Reference Manual; by
     Jeremy G. Siek, Lie-Quan Lee, and Andrew Lumsdaine;
     (Addison-Wesley, Pearson Education Inc., 2002), xxiv+321pp. ISBN
     0-201-72914-8

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

_E_x_a_m_p_l_e_s:

     con1 <- file(system.file("XML/dijkex.gxl",package="RBGL"), open="r")
     g1 <- fromGXL(con1)
     close(con1)

     con2 <- file(system.file("XML/conn2.gxl",package="RBGL"), open="r")
     g2 <- fromGXL(con2)
     close(con2)

     isomorphism(g1, g2)

