graph.bipartite(types, edges, directed=FALSE)
is.bipartite(graph)
graph
function. It is checked that the
edges indeed connect vertices of different kind, accoding to the
supplied types
graph.bipartite
returns a bipartite igraph graph. In other
words, an igraph graph that has a vertex attribute named type
. is.bipartite
returns a logical scalar.
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.bipartite
basically does three things. First it checks
tha edges
vector against the vertex types
. Then it
creates a graph using the edges
vector and finally it adds the
types
vector as a vertex attribute called type
.
is.bipartite
checks whether the graph is bipartite or not. It
just checks whether the graph has a vertex attribute called
type
.
graph
to create one-mode networksg <- graph.bipartite( rep(0:1,length=10), c(1:10))
print(g, v=TRUE)
Run the code above in your browser using DataLab