as_incidence_matrix | R Documentation |
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.
as_incidence_matrix(
graph,
types = NULL,
attr = NULL,
names = TRUE,
sparse = FALSE
)
graph |
The input graph. The direction of the edges is ignored in directed graphs. |
types |
An optional vertex type vector to use instead of the
|
attr |
Either |
names |
Logical scalar, if |
sparse |
Logical scalar, if it is |
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.
A sparse or dense matrix.
Gabor Csardi csardi.gabor@gmail.com
graph_from_incidence_matrix()
for the opposite operation.
Other conversion:
as.directed()
,
as.matrix.igraph()
,
as_adj_list()
,
as_adjacency_matrix()
,
as_data_frame()
,
as_edgelist()
,
as_graphnel()
,
as_long_data_frame()
,
graph_from_adj_list()
,
graph_from_graphnel()
g <- make_bipartite_graph(c(0, 1, 0, 1, 0, 0), c(1, 2, 2, 3, 3, 4))
as_incidence_matrix(g)
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.