Fix documentation

R/make.R

@@ -1574,7 +1574,7 @@ full_bipartite_graph <- function(...) constructor_spec(make_full_bipartite_graph
 #' `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 is.bipartite
+#' @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.
 #'   When the vector is a named vector, the names will be attached to the graph

R/structural.properties.R

@@ -1067,6 +1067,7 @@ all_shortest_paths <- function(graph, from,
 #' @param to The target vertex of the shortest paths.
 #' @param k The number of paths to find. They will be returned in order of
 #' increasing length.
+#' @inheritParams rlang::args_dots_empty
 #' @inheritParams shortest_paths
 #' @return A named list with two components is returned:
 #' \item{vpaths}{The list of \eqn{k} shortest paths in terms of vertices}