refactor: Tidy 🚧

R/create.R

@@ -208,7 +208,7 @@ as_sfnetwork = function(x, ...) {
 #' an \code{\link[sf]{sf}} object through \code{\link[sf]{st_as_sf}}. Arguments
 #' to \code{\link[sf]{st_as_sf}} can be provided as additional arguments and
 #' will be forwarded to \code{\link[sf]{st_as_sf}} through the
-#' code{\link{sfnetwork}} construction function.
+#' \code{\link{sfnetwork}} construction function.
 #'
 #' @importFrom tidygraph as_tbl_graph
 #' @export
@@ -380,7 +380,7 @@ as_sfnetwork.sfNetwork = function(x, ...) {
 #' \code{\link[sf]{sf}} object through \code{\link[sf]{st_as_sf}}. Arguments
 #' to \code{\link[sf]{st_as_sf}} can be provided as additional arguments and
 #' will be forwarded to \code{\link[sf]{st_as_sf}} through the
-#' code{\link{sfnetwork}} construction function. The directness of the original
+#' \code{\link{sfnetwork}} construction function. The directness of the original
 #' graph is preserved unless specified otherwise through the \code{directed}
 #' argument.
 #'
@@ -591,7 +591,7 @@ create_from_spatial_lines = function(x, directed = TRUE, compute_length = FALSE,
 #' whenever possible.
 #'
 #' The provided adjacency matrix may also be sparse. This can be an object of
-#' one of the sparse matrix classes from the \code{\pkg{Matrix}} package, or a
+#' one of the sparse matrix classes from the \pkg{Matrix} package, or a
 #' list-formatted sparse matrix. This is a list with one element per node,
 #' holding the integer indices of the nodes it is adjacent to. An example are
 #' \code{\link[sf]{sgbp}} objects. If the values are not integers, they are

R/ids.R

@@ -46,7 +46,7 @@ edge_ids = function(x, focused = TRUE) {
 #' @param data An object of class \code{\link{sfnetwork}}.
 #'
 #' @param query The query that defines for which nodes to extract indices,
-#' defused into a \code{\link[dplyr:topic-quosure]{quosure}}. See Details for
+#' defused into a \code{\link[rlang:topic-quosure]{quosure}}. See Details for
 #' the different ways in which node queries can be formulated.
 #'
 #' @details There are multiple ways in which node indices can be queried in
@@ -121,7 +121,7 @@ evaluate_node_query = function(data, query) {
 #' @param data An object of class \code{\link{sfnetwork}}.
 #'
 #' @param query The query that defines for which edges to extract indices,
-#' defused into a \code{\link[dplyr:topic-quosure]{quosure}}. See Details for
+#' defused into a \code{\link[rlang:topic-quosure]{quosure}}. See Details for
 #' the different ways in which edge queries can be formulated.
 #'
 #' @details There are multiple ways in which edge indices can be queried in

R/nb.R

@@ -2,8 +2,8 @@
 #'
 #' Neighbor lists are sparse adjacency matrices in list format that specify for
 #' each node to which other nodes it is adjacent. They occur for example in the
-#' \code{\pkg{sf}} package as \code{\link[sf]{sgbp}} objects, and are also
-#' frequently used in the \code{\pkg{spdep}} package.
+#' \pkg{sf} package as \code{\link[sf]{sgbp}} objects, and are also
+#' frequently used in the \pkg{spdep} package.
 #'
 #' @param x For the conversion to sfnetwork: a neighbor list, which is a list
 #  with one element per node that holds the integer indices of the nodes it is

R/weights.R

@@ -6,7 +6,7 @@
 #' @param data An object of class \code{\link{sfnetwork}}.
 #'
 #' @param spec The specification that defines how to compute or extract edge
-#' weights defused into a \code{\link[dplyr:topic-quosure]{quosure}}. See
+#' weights defused into a \code{\link[rlang:topic-quosure]{quosure}}. See
 #' Details for the different ways in which edge weights can be specified.
 #'
 #' @details There are multiple ways in which edge weights can be specified in