graph.full.bipartite         package:igraph         R Documentation

_C_r_e_a_t_e _a _f_u_l_l _b_i_p_a_r_t_i_t_e _g_r_a_p_h

_D_e_s_c_r_i_p_t_i_o_n:

     Bipartite graphs are also called two-mode by some. This function
     creates a bipartite graph in which every possible edge is present.

_U_s_a_g_e:

     graph.full.bipartite (n1, n2, directed = FALSE, mode = c("all", "out", "in")) 

_A_r_g_u_m_e_n_t_s:

      n1: The number of vertices of the first kind.

      n2: The number of vertices of the second kind.

directed: Logical scalar, whether the graphs is directed.

    mode: Scalar giving the kind of edges to create for directed
          graphs. If this is ''out'' then all vertices of the first
          kind are connected to the others; ''in'' specifies the
          opposite direction; ''all'' creates mutual edges. This
          argument is ignored for undirected graphs.x

_D_e_t_a_i_l_s:

     Bipartite graphs have a ''type'' vertex attribute in igraph, this
     is boolean and 'FALSE' for the vertices of the first kind and
     'TRUE' for vertices of the second kind.

_V_a_l_u_e:

     An igraph graph, with the ''type'' vertex attribute set.

_A_u_t_h_o_r(_s):

     Gabor Csardi csardi@rmki.kfki.hu

_S_e_e _A_l_s_o:

     'graph.full' for creating one-mode full graphs

_E_x_a_m_p_l_e_s:

     g <- graph.full.bipartite(2, 3)
     g2 <- graph.full.bipartite(2, 3, dir=TRUE)
     g3 <- graph.full.bipartite(2, 3, dir=TRUE, mode="in")
     g4 <- graph.full.bipartite(2, 3, dir=TRUE, mode="all")

