EVOLUTION-MANAGER
Edit File: make_full_bipartite_graph.html
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Strict//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-strict.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><title>R: Create a full bipartite graph</title> <meta http-equiv="Content-Type" content="text/html; charset=utf-8" /> <link rel="stylesheet" type="text/css" href="R.css" /> </head><body> <table width="100%" summary="page for make_full_bipartite_graph {igraph}"><tr><td>make_full_bipartite_graph {igraph}</td><td style="text-align: right;">R Documentation</td></tr></table> <h2>Create a full bipartite graph</h2> <h3>Description</h3> <p>Bipartite graphs are also called two-mode by some. This function creates a bipartite graph in which every possible edge is present. </p> <h3>Usage</h3> <pre> make_full_bipartite_graph( n1, n2, directed = FALSE, mode = c("all", "out", "in") ) full_bipartite_graph(...) </pre> <h3>Arguments</h3> <table summary="R argblock"> <tr valign="top"><td><code>n1</code></td> <td> <p>The number of vertices of the first kind.</p> </td></tr> <tr valign="top"><td><code>n2</code></td> <td> <p>The number of vertices of the second kind.</p> </td></tr> <tr valign="top"><td><code>directed</code></td> <td> <p>Logical scalar, whether the graphs is directed.</p> </td></tr> <tr valign="top"><td><code>mode</code></td> <td> <p>Scalar giving the kind of edges to create for directed graphs. If this is ‘<code>out</code>’ then all vertices of the first kind are connected to the others; ‘<code>in</code>’ specifies the opposite direction; ‘<code>all</code>’ creates mutual edges. This argument is ignored for undirected graphs.x</p> </td></tr> <tr valign="top"><td><code>...</code></td> <td> <p>Passed to <code>make_full_bipartite_graph</code>.</p> </td></tr> </table> <h3>Details</h3> <p>Bipartite graphs have a ‘<code>type</code>’ vertex attribute in igraph, this is boolean and <code>FALSE</code> for the vertices of the first kind and <code>TRUE</code> for vertices of the second kind. </p> <h3>Value</h3> <p>An igraph graph, with the ‘<code>type</code>’ vertex attribute set. </p> <h3>Author(s)</h3> <p>Gabor Csardi <a href="mailto:csardi.gabor@gmail.com">csardi.gabor@gmail.com</a> </p> <h3>See Also</h3> <p><code><a href="make_full_graph.html">make_full_graph</a></code> for creating one-mode full graphs </p> <h3>Examples</h3> <pre> g <- make_full_bipartite_graph(2, 3) g2 <- make_full_bipartite_graph(2, 3, directed=TRUE) g3 <- make_full_bipartite_graph(2, 3, directed=TRUE, mode="in") g4 <- make_full_bipartite_graph(2, 3, directed=TRUE, mode="all") </pre> <hr /><div style="text-align: center;">[Package <em>igraph</em> version 1.3.5 <a href="00Index.html">Index</a>]</div> </body></html>