graph.bipartite            package:igraph            R Documentation

_C_r_e_a_t_e _a _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:

     A bipartite graph has two kinds of vertices and connections are
     only allowed between different kinds.

_U_s_a_g_e:

     graph.bipartite(types, edges, directed=FALSE)

_A_r_g_u_m_e_n_t_s:

   types: A vector giving the vertex types. It will be coerced into
          boolean. The length of the vector gives the number of
          vertices in the graph.

   edges: A vector giving the edges of the graph, the same way as for
          the regular 'graph' function. It is checked that the edges
          indeed connect vertices of different kind, accoding to the
          supplied 'types' vector.

directed: Whether to create a directed graph, boolean constant. Note
          that by default undirected graphs are created, as this is
          more common for bipartite graphs.

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

     'graph.bipartite' basically does three things. First it checks tha
     'edges' vector against the vertex 'types'. Then it creates a graph
     using the 'edges' vector and finally it adds the 'types' vector as
     a vertex attribute called 'type'.

_V_a_l_u_e:

     A bipartite igraph graph. In other words, an igraph graph that has
     a vertex attribute 'type'.

_A_u_t_h_o_r(_s):

     Gabor Csardi csardi@rmki.kfki.hu

_S_e_e _A_l_s_o:

     'graph' to create one-mode networks

_E_x_a_m_p_l_e_s:

     g <- graph.bipartite( rep(0:1,length=10), c(0:9))
     print(g, v=TRUE)

