Incidence matrix of a bipartite graphSource:
This function can return a sparse or dense incidence matrix of a bipartite network. The incidence matrix is an \(n\) times \(m\) matrix, \(n\) and \(m\) are the number of vertices of the two kinds.
The input graph. The direction of the edges is ignored in directed graphs.
An optional vertex type vector to use instead of the
typevertex attribute. You must supply this argument if the graph has no
NULLor a character string giving an edge attribute name. If
NULL, then a traditional incidence matrix is returned. If not
NULLthen the values of the given edge attribute are included in the incidence matrix. If the graph has multiple edges, the edge attribute of an arbitrarily chosen edge (for the multiple edges) is included.
Logical scalar, if
TRUEand the vertices in the graph are named (i.e. the graph has a vertex attribute called
name), then vertex names will be added to the result as row and column names. Otherwise the ids of the vertices are used as row and column names.
Logical scalar, if it is
TRUEthen a sparse matrix is created, you will need the
Matrixpackage for this.
Bipartite graphs have a
type vertex attribute in igraph, this is
FALSE for the vertices of the first kind and
for vertices of the second kind.
graph_from_incidence_matrix() for the opposite operation.
Gabor Csardi email@example.com
g <- make_bipartite_graph(c(0, 1, 0, 1, 0, 0), c(1, 2, 2, 3, 3, 4)) as_incidence_matrix(g) #> 2 4 #> 1 1 0 #> 3 1 1 #> 5 0 0 #> 6 0 0