A bipartite graph has two kinds of vertices and connections are only allowed between different kinds.
The input graph.
A vector giving the vertex types. It will be coerced into boolean. The length of the vector gives the number of vertices in the graph. When the vector is a named vector, the names will be attached to the graph as the
A vector giving the edges of the graph, the same way as for the regular
graph()function. It is checked that the edges indeed connect vertices of different kind, according to the supplied
typesvector. The vector may be a string vector if
typesis a named vector.
Whether to create a directed graph, boolean constant. Note that by default undirected graphs are created, as this is more common for bipartite graphs.
make_bipartite_graph() returns a bipartite igraph graph. In other
words, an igraph graph that has a vertex attribute named
is_bipartite() returns a logical scalar.
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.
make_bipartite_graph() basically does three things. First it checks the
edges vector against the vertex
types. Then it creates a graph
edges vector and finally it adds the
types vector as
a vertex attribute called
edges may contain strings as
vertex names; in this case,
types must be a named vector that specifies
the type for each vertex name that occurs in
is_bipartite() checks whether the graph is bipartite or not. It just
checks whether the graph has a vertex attribute called
Gabor Csardi email@example.com