docs: split is_bipartite() manual page from other manual page (#1230)

R/attributes.R

@@ -164,7 +164,7 @@ is.named <- function(graph) { # nocov start
   is_named(graph = graph)
 } # nocov end
 
-#' Create a bipartite graph
+#' Checks whether the graph has a vertex attribute called `type`
 #'
 #' @description
 #' `r lifecycle::badge("deprecated")`
@@ -1003,7 +1003,11 @@ is_weighted <- function(graph) {
   "weight" %in% edge_attr_names(graph)
 }
 
-#' @rdname make_bipartite_graph
+#' @title Checks whether the graph has a vertex attribute called `type`.
+#' @description It does not check whether the graph is bipartite in the
+#'  mathematical sense.  Use [bipartite_mapping()] for that.
+#' @family bipartite
+#' @param graph The input graph
 #' @export
 is_bipartite <- function(graph) {
   ensure_igraph(graph)

R/make.R

@@ -1553,9 +1553,6 @@ full_bipartite_graph <- function(...) constructor_spec(make_full_bipartite_graph
 #' vertex names; in this case, `types` must be a named vector that specifies
 #' the type for each vertex name that occurs in `edges`.
 #'
-#' `is_bipartite()` checks whether the graph is bipartite or not. It just
-#' checks whether the graph has a vertex attribute called `type`.
-#'
 #' @aliases graph.bipartite
 #' @param types 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.
@@ -1568,7 +1565,6 @@ full_bipartite_graph <- function(...) constructor_spec(make_full_bipartite_graph
 #' @param directed Whether to create a directed graph, boolean constant. Note
 #'   that by default undirected graphs are created, as this is more common for
 #'   bipartite graphs.
-#' @param graph The input graph.
 #' @return `make_bipartite_graph()` returns a bipartite igraph graph. In other
 #'   words, an igraph graph that has a vertex attribute named `type`.
 #'