Project a bipartite graph
A bipartite graph is projected into two one-mode networks
bipartite.projection.size(graph, types=NULL) bipartite.projection (graph, types=NULL, probe1=-1)
- The input graph. It can be directed, but edge directions are ignored during the computation.
- An optional vertex type vector to use instead of the
vertex attribute. You must supply this argument if the graph has no
- 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.
Bipartite graphs have a
FALSE for the vertices of the first
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
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
TRUE is the second.
- A list of two undirected graphs. See details above.
- Bipartite graph
- Two-mode network
## Projection of a full bipartite graph is a full graph g <- graph.full.bipartite(10,5) proj <- bipartite.projection(g) graph.isomorphic(proj[], graph.full(10)) graph.isomorphic(proj[], graph.full(5))