graph.incidence {igraph} | R Documentation |
graph.incidence
creates a bipartite igraph graph
from an incidence matrix.
graph.incidence(incidence, directed = FALSE, mode = c("all", "out", "in", "total"), multiple = FALSE, weighted = NULL, add.names = NULL)
incidence |
The input incidence matrix. It can also be a sparse
matrix from the |
directed |
Logical scalar, whether to create a directed graph. |
mode |
A character constant, defines the direction of the edges
in directed graphs, ignored for undirected graphs. If
‘ |
multiple |
Logical scalar, specifies how to interpret the matrix elements. See details below. |
weighted |
This argument specifies whether to create a weighted
graph from the incidence matrix. If it is |
add.names |
A character constant, |
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.incidence
can operate in two modes, depending on the
multiple
argument. If it is FALSE
then a single edge is
created for every non-zero element in the incidence matrix. If
multiple
is TRUE
, then the matrix elements are rounded up
to the closest non-negative integer to get the number of edges to
create between a pair of vertices.
A bipartite igraph graph. In other words, an igraph graph that has a
vertex attribute type
.
Gabor Csardi csardi@rmki.kfki.hu
graph.bipartite
for another way to create
bipartite graphs
inc <- matrix(sample(0:1, 15, repl=TRUE), 3, 5) colnames(inc) <- letters[1:5] rownames(inc) <- LETTERS[1:3] graph.incidence(inc)