bipartite.projection         package:igraph         R Documentation

_P_r_o_j_e_c_t _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 is projected into two one-mode networks

_U_s_a_g_e:

     bipartite.projection.size(graph, types=NULL)
     bipartite.projection (graph, types=NULL, probe1=-1)

_A_r_g_u_m_e_n_t_s:

   graph: The input graph. It can be directed, but edge directions are
          ignored during the computation.

   types: An optional vertex type vector to use instead of the ''type''
          vertex attribute. You must supply this argument if the graph
          has no ''type'' vertex attribute.

  probe1: This argument can be used to specify the order of the
          projections in the resulting list. If given and non-negative,
          then it is considered as a vertex id; the projection
          containing the first one in the result list.

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

     'bipartite.projection.size' calculates the number of vertices and
     edges in the two projections of the bipartite graphs, without
     calculating the projections themselves. This is useful to check
     how much memory the projections would need if you have a large
     bipartite graph.

     'bipartite.projections' calculates the actual projections. You can
     use the 'probe1' argument to specify the order of the projections
     in the result. By default vertex type 'FALSE' is the first and
     'TRUE' is the second.

_V_a_l_u_e:

     A list of two undirected graphs. See details above.

_A_u_t_h_o_r(_s):

     Gabor Csardi csardi@rmki.kfki.hu

_E_x_a_m_p_l_e_s:

     ## Projection of a full bipartite graph is a full graph
     g <- graph.full.bipartite(10,5)
     proj <- bipartite.projection(g)
     graph.isomorphic(proj[[1]], graph.full(10))
     graph.isomorphic(proj[[2]], graph.full(5))

