% Generated by roxygen2: do not edit by hand
% Please edit documentation in R/make.R
\name{graph.full.bipartite}
\alias{graph.full.bipartite}
\title{Create a full bipartite graph}
\usage{
graph.full.bipartite(n1, n2, directed = FALSE, mode = c("all", "out", "in"))
}
\arguments{
\item{n1}{The number of vertices of the first kind.}

\item{n2}{The number of vertices of the second kind.}

\item{directed}{Logical scalar, whether the graphs is directed.}

\item{mode}{Scalar giving the kind of edges to create for directed graphs.
If this is \sQuote{\code{out}} then all vertices of the first kind are
connected to the others; \sQuote{\verb{in}} specifies the opposite
direction; \sQuote{\code{all}} creates mutual edges. This argument is
ignored for undirected graphs.x}
}
\description{
\ifelse{html}{\href{https://lifecycle.r-lib.org/articles/stages.html#deprecated}{\figure{lifecycle-deprecated.svg}{options: alt='[Deprecated]'}}}{\strong{[Deprecated]}}

\code{graph.full.bipartite()} was renamed to \code{\link[=make_full_bipartite_graph]{make_full_bipartite_graph()}} to create a more
consistent API.
}
\section{Related documentation in the C library}{
\href{https://igraph.org/c/html/0.10.17/igraph-Bipartite.html#igraph_full_bipartite}{\code{full_bipartite()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}
}

\keyword{internal}
