1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
|
% Generated by roxygen2: do not edit by hand
% Please edit documentation in R/games.R
\name{bipartite.random.game}
\alias{bipartite.random.game}
\title{Bipartite random graphs}
\usage{
bipartite.random.game(
n1,
n2,
type = c("gnp", "gnm"),
p,
m,
directed = FALSE,
mode = c("out", "in", "all")
)
}
\arguments{
\item{n1}{Integer scalar, the number of bottom vertices.}
\item{n2}{Integer scalar, the number of top vertices.}
\item{type}{Character scalar, the type of the graph, \sQuote{gnp} creates a
\eqn{G(n,p)} graph, \sQuote{gnm} creates a \eqn{G(n,m)} graph. See details below.}
\item{p}{Real scalar, connection probability for \eqn{G(n,p)} graphs. Should not
be given for \eqn{G(n,m)} graphs.}
\item{m}{Integer scalar, the number of edges for \eqn{G(n,m)} graphs. Should not
be given for \eqn{G(n,p)} graphs.}
\item{directed}{Logical scalar, whether to create a directed graph. See also
the \code{mode} argument.}
\item{mode}{Character scalar, specifies how to direct the edges in directed
graphs. If it is \sQuote{out}, then directed edges point from bottom
vertices to top vertices. If it is \sQuote{in}, edges point from top
vertices to bottom vertices. \sQuote{out} and \sQuote{in} do not generate
mutual edges. If this argument is \sQuote{all}, then each edge direction is
considered independently and mutual edges might be generated. This argument
is ignored for undirected graphs.}
}
\description{
\ifelse{html}{\href{https://lifecycle.r-lib.org/articles/stages.html#deprecated}{\figure{lifecycle-deprecated.svg}{options: alt='[Deprecated]'}}}{\strong{[Deprecated]}}
\code{bipartite.random.game()} was renamed to \code{sample_bipartite()} to create a more
consistent API.
}
\keyword{internal}
|
