Bipartite graphs are also called two-mode by some. This function creates a bipartite graph in which every possible edge is present.
make_full_bipartite_graph(n1, n2, directed = FALSE, mode = c("all",
"out", "in"))full_bipartite_graph(...)
The number of vertices of the first kind.
The number of vertices of the second kind.
Logical scalar, whether the graphs is directed.
Scalar giving the kind of edges to create for directed graphs.
If this is ‘out
’ then all vertices of the first kind are
connected to the others; ‘in
’ specifies the opposite
direction; ‘all
’ creates mutual edges. This argument is
ignored for undirected graphs.x
Passed to make_full_bipartite_graph
.
An igraph graph, with the ‘type
’ vertex attribute set.
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.
make_full_graph
for creating one-mode full graphs
# NOT RUN {
g <- make_full_bipartite_graph(2, 3)
g2 <- make_full_bipartite_graph(2, 3, dir=TRUE)
g3 <- make_full_bipartite_graph(2, 3, dir=TRUE, mode="in")
g4 <- make_full_bipartite_graph(2, 3, dir=TRUE, mode="all")
# }
Run the code above in your browser using DataLab