Incidence matrix of a bipartite graph
This function can return a sparse of 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.x
get.incidence(graph, types=NULL, attr=NULL, names=TRUE, sparse=FALSE)
- The input graph. The direction of the edges is ignored in directed graphs.
- An optional vertex type vector to use instead of the
vertex attribute. You must supply this argument if the graph has no
NULLor a character string giving an edge attribute name. If
NULLa traditional incidence matrix is returned. If not
NULLthen the values of the given edge attribute are included in the incidence m
- Logical scalar, if
TRUEand the vertices in the graph are named (i.e. the graph has a vertex attribute called
), then vertex names will be added to the result as row and column names. Otherwise th
- Logical scalar, if it is
TRUEthen a sparse matrix is created, you will need the
Matrixpackage for this.
Bipartite graphs have a
FALSE for the vertices of the first
TRUE for vertices of the second kind.
The vertex ids corresponding to rows and columns in the incidence matrix are returned as row/column names.
- A sparse or dense matrix.
- Bipartite graph
- Two-mode network
- Incidence matrix
graph.incidence for the opposite operation.
g <- graph.bipartite( c(0,1,0,1,0,0), c(0,1,1,2,2,3) ) get.incidence(g)