From 6b3b76bc4b09eb213a1c6f97b6fd7b36c17624b7 Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?Ma=C3=ABlle=20Salmon?= Date: Wed, 19 Feb 2025 11:19:45 +0100 Subject: [PATCH 1/8] feat: Split `sample_bipartite()` into two functions for the G(n, m) and G(n, p) case --- .Rbuildignore | 6 +- NAMESPACE | 4 + R/aaa-auto.R | 32 +++++ R/games.R | 184 +++++++++++++++++++++-------- man/dominator_tree.Rd | 6 +- man/edge_connectivity.Rd | 2 +- man/erdos.renyi.game.Rd | 1 + man/graph_from_adjacency_matrix.Rd | 14 +-- man/sample_.Rd | 1 + man/sample_bipartite.Rd | 11 +- man/sample_bipartite_gnm.Rd | 108 +++++++++++++++++ man/sample_chung_lu.Rd | 3 +- man/sample_correlated_gnp.Rd | 1 + man/sample_correlated_gnp_pair.Rd | 1 + man/sample_degseq.Rd | 1 + man/sample_dot_product.Rd | 1 + man/sample_fitness.Rd | 1 + man/sample_fitness_pl.Rd | 1 + man/sample_forestfire.Rd | 1 + man/sample_gnm.Rd | 1 + man/sample_gnp.Rd | 1 + man/sample_grg.Rd | 1 + man/sample_growing.Rd | 1 + man/sample_hierarchical_sbm.Rd | 1 + man/sample_islands.Rd | 1 + man/sample_k_regular.Rd | 1 + man/sample_last_cit.Rd | 1 + man/sample_pa.Rd | 1 + man/sample_pa_age.Rd | 1 + man/sample_pref.Rd | 1 + man/sample_sbm.Rd | 1 + man/sample_smallworld.Rd | 1 + man/sample_traits_callaway.Rd | 1 + man/sample_tree.Rd | 1 + man/st_cuts.Rd | 6 +- man/st_min_cuts.Rd | 4 +- tools/stimulus/functions-R.yaml | 4 +- 37 files changed, 331 insertions(+), 77 deletions(-) create mode 100644 man/sample_bipartite_gnm.Rd diff --git a/.Rbuildignore b/.Rbuildignore index cb62bebd9f0..ad8aef71c5f 100644 --- a/.Rbuildignore +++ b/.Rbuildignore @@ -52,11 +52,11 @@ ^compile_commands\.json$ ^\.cache$ ^rchk$ +^vendor\.sh$ +^vendor-one\.sh$ +^patch$ ^man/dot-igraph.progress\.Rd$ ^man/dot-igraph.status\.Rd$ ^man/dot-extract_constructor_and_modifiers\.Rd$ ^man/dot-apply_modifiers\.Rd$ ^man/handle_vertex_type_arg\.Rd$ -^vendor\.sh$ -^vendor-one\.sh$ -^patch$ diff --git a/NAMESPACE b/NAMESPACE index d1c40956c18..62529efb227 100644 --- a/NAMESPACE +++ b/NAMESPACE @@ -186,6 +186,8 @@ export(bipartite.mapping) export(bipartite.projection) export(bipartite.projection.size) export(bipartite.random.game) +export(bipartite_gnm) +export(bipartite_gnp) export(bipartite_graph) export(bipartite_mapping) export(bipartite_projection) @@ -746,6 +748,8 @@ export(running_mean) export(sample_) export(sample_asym_pref) export(sample_bipartite) +export(sample_bipartite_gnm) +export(sample_bipartite_gnp) export(sample_chung_lu) export(sample_cit_cit_types) export(sample_cit_types) diff --git a/R/aaa-auto.R b/R/aaa-auto.R index a0a4c5c571f..0b393b7ac14 100644 --- a/R/aaa-auto.R +++ b/R/aaa-auto.R @@ -2080,6 +2080,38 @@ is_bipartite_impl <- function(graph) { res } + +bipartite_game_gnp_impl <- function(n1, n2, p, directed=FALSE, mode=c("all", "out", "in", "total")) { + # Argument checks + n1 <- as.numeric(n1) + n2 <- as.numeric(n2) + p <- as.numeric(p) + directed <- as.logical(directed) + mode <- switch(igraph.match.arg(mode), "out"=1L, "in"=2L, "all"=3L, "total"=3L) + + on.exit( .Call(R_igraph_finalizer) ) + # Function call + res <- .Call(R_igraph_bipartite_game_gnp, n1, n2, p, directed, mode) + res <- set_vertex_attr(res$graph, "type", value = res$types) + res +} + +bipartite_game_gnm_impl <- function(n1, n2, m, directed=FALSE, mode=c("all", "out", "in", "total")) { + # Argument checks + n1 <- as.numeric(n1) + n2 <- as.numeric(n2) + m <- as.numeric(m) + directed <- as.logical(directed) + mode <- switch(igraph.match.arg(mode), "out"=1L, "in"=2L, "all"=3L, "total"=3L) + + on.exit( .Call(R_igraph_finalizer) ) + # Function call + res <- .Call(R_igraph_bipartite_game_gnm, n1, n2, m, directed, mode) + res <- set_vertex_attr(res$graph, "type", value = res$types) + + res +} + get_laplacian_impl <- function(graph, mode=c("out", "in", "all", "total"), normalization=c("unnormalized", "symmetric", "left", "right"), weights=NULL) { # Argument checks ensure_igraph(graph) diff --git a/R/games.R b/R/games.R index 29ba7631a31..2df97d89d7b 100644 --- a/R/games.R +++ b/R/games.R @@ -264,7 +264,10 @@ callaway.traits.game <- function(nodes, types, edge.per.step = 1, type.dist = re #' @keywords internal #' @export bipartite.random.game <- function(n1, n2, type = c("gnp", "gnm"), p, m, directed = FALSE, mode = c("out", "in", "all")) { # nocov start - lifecycle::deprecate_soft("2.0.0", "bipartite.random.game()", "sample_bipartite()") + lifecycle::deprecate_warn( + "2.0.0", "bipartite.random.game()", + details = "Use sample_bipartite_gnp() or sample_bipartite_gnm()" + ) sample_bipartite(n1 = n1, n2 = n2, type = type, p = p, m = m, directed = directed, mode = mode) } # nocov end @@ -1703,13 +1706,8 @@ cit_cit_types <- function(...) constructor_spec(sample_cit_cit_types, ...) #' Bipartite random graphs #' -#' Generate bipartite graphs using the Erdős-Rényi model -#' -#' Similarly to unipartite (one-mode) networks, we can define the \eqn{G(n,p)}, and -#' \eqn{G(n,m)} graph classes for bipartite graphs, via their generating process. -#' In \eqn{G(n,p)} every possible edge between top and bottom vertices is realized -#' with probability \eqn{p}, independently of the rest of the edges. In \eqn{G(n,m)}, we -#' uniformly choose \eqn{m} edges to realize. +#' `r lifecycle::badge("deprecated")` Generate bipartite graphs using the Erdős-Rényi model. +#' Use [`sample_bipartite_gnm()`] and [`sample_bipartite_gnp()`] instead. #' #' @param n1 Integer scalar, the number of bottom vertices. #' @param n2 Integer scalar, the number of top vertices. @@ -1749,55 +1747,147 @@ cit_cit_types <- function(...) constructor_spec(sample_cit_cit_types, ...) #' sample_bipartite <- function(n1, n2, type = c("gnp", "gnm"), p, m, directed = FALSE, mode = c("out", "in", "all")) { - n1 <- as.numeric(n1) - n2 <- as.numeric(n2) - type <- igraph.match.arg(type) - if (!missing(p)) { - p <- as.numeric(p) - } - if (!missing(m)) { - m <- as.numeric(m) - } - directed <- as.logical(directed) - mode <- switch(igraph.match.arg(mode), - "out" = 1, - "in" = 2, - "all" = 3 - ) - if (type == "gnp" && missing(p)) { - cli::cli_abort("Connection probability {.arg p} must be given for Gnp graph") - } - if (type == "gnp" && !missing(m)) { - cli::cli_warn("Number of edges {.arg m} is ignored for Gnp graph.") - } - if (type == "gnm" && missing(m)) { - cli::cli_abort("Number of edges {.arg m} must be given for Gnm graph") - } - if (type == "gnm" && !missing(p)) { - cli::cli_warn("Connection probability {.arg p} is ignored for Gnm graph.") - } + type <- igraph.match.arg(type) + mode <- igraph.match.arg(mode) - on.exit(.Call(R_igraph_finalizer)) if (type == "gnp") { - res <- .Call(R_igraph_bipartite_game_gnp, n1, n2, p, directed, mode) - res <- set_vertex_attr(res$graph, "type", value = res$types) - res$name <- "Bipartite Gnp random graph" - res$p <- p + lifecycle::deprecate_soft( + "2.1.3", + "sample_bipartite()", + "sample_bipartite_gnp()" + ) + sample_bipartite_gnp(n1, n2, p, directed = directed, mode = mode) } else if (type == "gnm") { - res <- .Call(R_igraph_bipartite_game_gnm, n1, n2, m, directed, mode) - res <- set_vertex_attr(res$graph, "type", value = res$types) - res$name <- "Bipartite Gnm random graph" - res$m <- m + lifecycle::deprecate_soft( + "2.1.3", + "sample_bipartite()", + "sample_bipartite_gnm()" + ) + sample_bipartite_gnm(n1, n2, m, directed = directed, mode = mode) } - - res } #' @rdname sample_bipartite #' @param ... Passed to `sample_bipartite()`. #' @export -bipartite <- function(...) constructor_spec(sample_bipartite, ...) +bipartite <- function(...) { + + if (!rlang::is_missing(type) && type == "gnp") { + lifecycle::deprecate_soft( + "2.1.3", + "bipartite()", + "bipartite_gnp()" + ) + bipartite_gnp(...) + } else if (!rlang::is_missing(type) && type == "gnm") { + lifecycle::deprecate_soft( + "2.1.3", + "bipartite()", + "bipartite_gnm()" + ) + bipartite_gnm(...) + } + +} + +#' @rdname sample_bipartite_gnm +#' @param ... Passed to `sample_bipartite_gnm()`. +#' @export +bipartite_gnm <- function(...) constructor_spec(sample_bipartite_gnm, ...) + +#' @rdname sample_bipartite_gnm +#' @param ... Passed to `sample_bipartite_gnp()`. +#' @export +bipartite_gnp <- function(...) constructor_spec(sample_bipartite_gnp, ...) + +#' Bipartite random graphs +#' +#' Generate bipartite graphs using the Erdős-Rényi model +#' +#' Similarly to unipartite (one-mode) networks, we can define the \eqn{G(n,p)}, and +#' \eqn{G(n,m)} graph classes for bipartite graphs, via their generating process. +#' In \eqn{G(n,p)} every possible edge between top and bottom vertices is realized +#' with probability \eqn{p}, independently of the rest of the edges. In \eqn{G(n,m)}, we +#' uniformly choose \eqn{m} edges to realize. +#' +#' +#' @param n1 Integer scalar, the number of bottom vertices. +#' @param n2 Integer scalar, the number of top vertices. +#' @param p Real scalar, connection probability for \eqn{G(n,p)} graphs. +#' @param m Integer scalar, the number of edges for \eqn{G(n,m)} graphs. +#' @param directed Logical scalar, whether to create a directed graph. See also +#' the `mode` argument. +#' @param 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. +#' @inheritParams rlang::args_dots_empty +#' @examples +#' +#' ## empty graph +#' sample_bipartite_gnp(10, 5, p = 0) +#' +#' ## full graph +#' sample_bipartite_gnp(10, 5, p = 1) +#' +#' ## random bipartite graph +#' sample_bipartite_gnp(10, 5, p = .1) +#' +#' ## directed bipartite graph, G(n,m) +#' sample_bipartite_gnm(10, 5, m = 20, directed = TRUE, mode = "all") +#' +#' @family games +#' @export +sample_bipartite_gnm <- function(n1, n2, m, + ..., + directed = FALSE, + mode = c("out", "in", "all")) { + check_dots_empty() + mode <- igraph.match.arg(mode) + m <- as.numeric(m) + + res <- bipartite_game_gnm_impl( + n1 = n1, + n2 = n2, + m = m, + directed = directed, + mode = mode + ) + res$name <- "Bipartite Gnm random graph" + res$m <- m + + res + +} +#' @rdname sample_bipartite_gnm +#' @export +sample_bipartite_gnp <- function(n1, n2, p, + ..., + directed = FALSE, + mode = c("out", "in", "all")) { + check_dots_empty() + mode <- igraph.match.arg(mode) + p <- as.numeric(p) + + res <- bipartite_game_gnp_impl( + n1 = n1, + n2 = n2, + p = p, + directed = directed, + mode = mode + ) + + res$name <- "Bipartite Gnp random graph" + res$p <- p + + res + +} + #' Sample stochastic block model diff --git a/man/dominator_tree.Rd b/man/dominator_tree.Rd index 230b9b9a40b..5fa5bd1a004 100644 --- a/man/dominator_tree.Rd +++ b/man/dominator_tree.Rd @@ -50,9 +50,9 @@ dominator tree of a directed graph. For details see the reference below. ## The example from the paper g <- graph_from_literal( - R -+ A:B:C, A -+ D, B -+ A:D:E, C -+ F:G, D -+ L, - E -+ H, F -+ I, G -+ I:J, H -+ E:K, I -+ K, J -+ I, - K -+ I:R, L -+ H + R - +A:B:C, A - +D, B - +A:D:E, C - +F:G, D - +L, + E - +H, F - +I, G - +I:J, H - +E:K, I - +K, J - +I, + K - +I:R, L - +H ) dtree <- dominator_tree(g, root = "R") layout <- layout_as_tree(dtree$domtree, root = "R") diff --git a/man/edge_connectivity.Rd b/man/edge_connectivity.Rd index e2b96878aab..914232a4be1 100644 --- a/man/edge_connectivity.Rd +++ b/man/edge_connectivity.Rd @@ -8,7 +8,7 @@ \usage{ edge_connectivity(graph, source = NULL, target = NULL, checks = TRUE) -edge_disjoint_paths(graph, source, target) +edge_disjoint_paths(graph, source = NULL, target = NULL) adhesion(graph, checks = TRUE) } diff --git a/man/erdos.renyi.game.Rd b/man/erdos.renyi.game.Rd index 3390cd3c4d3..caa0e0f924d 100644 --- a/man/erdos.renyi.game.Rd +++ b/man/erdos.renyi.game.Rd @@ -52,6 +52,7 @@ Mathematicae} 6, 290--297 (1959). } \seealso{ Random graph models (games) +\code{\link{bipartite_gnm}()}, \code{\link{sample_}()}, \code{\link{sample_bipartite}()}, \code{\link{sample_chung_lu}()}, diff --git a/man/graph_from_adjacency_matrix.Rd b/man/graph_from_adjacency_matrix.Rd index 7bc37508c2f..bb04f03a7cf 100644 --- a/man/graph_from_adjacency_matrix.Rd +++ b/man/graph_from_adjacency_matrix.Rd @@ -104,15 +104,15 @@ weights.} } \examples{ g1 <- sample( - x = 0:1, size = 100, replace = TRUE, - prob = c(0.9, 0.1) - ) \%>\% + x = 0:1, size = 100, replace = TRUE, + prob = c(0.9, 0.1) +) \%>\% matrix(ncol = 10) \%>\% graph_from_adjacency_matrix() g2 <- sample( - x = 0:5, size = 100, replace = TRUE, - prob = c(0.9, 0.02, 0.02, 0.02, 0.02, 0.02) + x = 0:5, size = 100, replace = TRUE, + prob = c(0.9, 0.02, 0.02, 0.02, 0.02, 0.02) ) \%>\% matrix(ncol = 10) \%>\% graph_from_adjacency_matrix(weighted = TRUE) @@ -178,8 +178,8 @@ halve_diag <- function(x) { x } expected_g8_weights <- non_zero_sort( - halve_diag(adj_matrix + t(adj_matrix) -)[lower.tri(adj_matrix, diag = TRUE)]) + halve_diag(adj_matrix + t(adj_matrix))[lower.tri(adj_matrix, diag = TRUE)] +) actual_g8_weights <- sort(E(g8)$weight) all(expected_g8_weights == actual_g8_weights) diff --git a/man/sample_.Rd b/man/sample_.Rd index ebea0a7d2dc..212a9fe71b5 100644 --- a/man/sample_.Rd +++ b/man/sample_.Rd @@ -46,6 +46,7 @@ blocky3 <- pref_matrix \%>\% } \seealso{ Random graph models (games) +\code{\link{bipartite_gnm}()}, \code{\link{erdos.renyi.game}()}, \code{\link{sample_bipartite}()}, \code{\link{sample_chung_lu}()}, diff --git a/man/sample_bipartite.Rd b/man/sample_bipartite.Rd index 313bc7b16ab..c1ecb188a30 100644 --- a/man/sample_bipartite.Rd +++ b/man/sample_bipartite.Rd @@ -48,14 +48,8 @@ is ignored for undirected graphs.} A bipartite igraph graph. } \description{ -Generate bipartite graphs using the Erdős-Rényi model -} -\details{ -Similarly to unipartite (one-mode) networks, we can define the \eqn{G(n,p)}, and -\eqn{G(n,m)} graph classes for bipartite graphs, via their generating process. -In \eqn{G(n,p)} every possible edge between top and bottom vertices is realized -with probability \eqn{p}, independently of the rest of the edges. In \eqn{G(n,m)}, we -uniformly choose \eqn{m} edges to realize. +\ifelse{html}{\href{https://lifecycle.r-lib.org/articles/stages.html#deprecated}{\figure{lifecycle-deprecated.svg}{options: alt='[Deprecated]'}}}{\strong{[Deprecated]}} Generate bipartite graphs using the Erdős-Rényi model. +Use \code{\link[=sample_bipartite_gnm]{sample_bipartite_gnm()}} and \code{\link[=sample_bipartite_gnp]{sample_bipartite_gnp()}} instead. } \examples{ @@ -74,6 +68,7 @@ sample_bipartite(10, 5, type = "Gnm", m = 20, directed = TRUE, mode = "all") } \seealso{ Random graph models (games) +\code{\link{bipartite_gnm}()}, \code{\link{erdos.renyi.game}()}, \code{\link{sample_}()}, \code{\link{sample_chung_lu}()}, diff --git a/man/sample_bipartite_gnm.Rd b/man/sample_bipartite_gnm.Rd new file mode 100644 index 00000000000..a6ec63a4d27 --- /dev/null +++ b/man/sample_bipartite_gnm.Rd @@ -0,0 +1,108 @@ +% Generated by roxygen2: do not edit by hand +% Please edit documentation in R/games.R +\name{bipartite_gnm} +\alias{bipartite_gnm} +\alias{bipartite_gnp} +\alias{sample_bipartite_gnm} +\alias{sample_bipartite_gnp} +\title{Bipartite random graphs} +\usage{ +bipartite_gnm(...) + +bipartite_gnp(...) + +sample_bipartite_gnm( + n1, + n2, + m, + ..., + directed = FALSE, + mode = c("out", "in", "all") +) + +sample_bipartite_gnp( + n1, + n2, + p, + ..., + directed = FALSE, + mode = c("out", "in", "all") +) +} +\arguments{ +\item{...}{Passed to \code{sample_bipartite_gnp()}.} + +\item{n1}{Integer scalar, the number of bottom vertices.} + +\item{n2}{Integer scalar, the number of top vertices.} + +\item{m}{Integer scalar, the number of edges for \eqn{G(n,m)} 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.} + +\item{p}{Real scalar, connection probability for \eqn{G(n,p)} graphs.} +} +\description{ +Generate bipartite graphs using the Erdős-Rényi model +} +\details{ +Similarly to unipartite (one-mode) networks, we can define the \eqn{G(n,p)}, and +\eqn{G(n,m)} graph classes for bipartite graphs, via their generating process. +In \eqn{G(n,p)} every possible edge between top and bottom vertices is realized +with probability \eqn{p}, independently of the rest of the edges. In \eqn{G(n,m)}, we +uniformly choose \eqn{m} edges to realize. +} +\examples{ + +## empty graph +sample_bipartite_gnp(10, 5, p = 0) + +## full graph +sample_bipartite_gnp(10, 5, p = 1) + +## random bipartite graph +sample_bipartite_gnp(10, 5, p = .1) + +## directed bipartite graph, G(n,m) +sample_bipartite_gnm(10, 5, m = 20, directed = TRUE, mode = "all") + +} +\seealso{ +Random graph models (games) +\code{\link{erdos.renyi.game}()}, +\code{\link{sample_}()}, +\code{\link{sample_bipartite}()}, +\code{\link{sample_chung_lu}()}, +\code{\link{sample_correlated_gnp}()}, +\code{\link{sample_correlated_gnp_pair}()}, +\code{\link{sample_degseq}()}, +\code{\link{sample_dot_product}()}, +\code{\link{sample_fitness}()}, +\code{\link{sample_fitness_pl}()}, +\code{\link{sample_forestfire}()}, +\code{\link{sample_gnm}()}, +\code{\link{sample_gnp}()}, +\code{\link{sample_grg}()}, +\code{\link{sample_growing}()}, +\code{\link{sample_hierarchical_sbm}()}, +\code{\link{sample_islands}()}, +\code{\link{sample_k_regular}()}, +\code{\link{sample_last_cit}()}, +\code{\link{sample_pa}()}, +\code{\link{sample_pa_age}()}, +\code{\link{sample_pref}()}, +\code{\link{sample_sbm}()}, +\code{\link{sample_smallworld}()}, +\code{\link{sample_traits_callaway}()}, +\code{\link{sample_tree}()} +} +\concept{games} diff --git a/man/sample_chung_lu.Rd b/man/sample_chung_lu.Rd index 529bd7fa221..e5040eda4d7 100644 --- a/man/sample_chung_lu.Rd +++ b/man/sample_chung_lu.Rd @@ -131,7 +131,7 @@ rowMeans(replicate( rowMeans(replicate( 100, - degree(sample_chung_lu(c(1, 3, 2, 1), c(2, 1, 2, 2), variant = "maxent"), mode='out') + degree(sample_chung_lu(c(1, 3, 2, 1), c(2, 1, 2, 2), variant = "maxent"), mode = "out") )) } \references{ @@ -168,6 +168,7 @@ with sharply specified degrees. \code{\link[=sample_gnp]{sample_gnp()}} creates fixed connection probability \eqn{p} between all vertex pairs. Random graph models (games) +\code{\link{bipartite_gnm}()}, \code{\link{erdos.renyi.game}()}, \code{\link{sample_}()}, \code{\link{sample_bipartite}()}, diff --git a/man/sample_correlated_gnp.Rd b/man/sample_correlated_gnp.Rd index c180df24596..563730a3498 100644 --- a/man/sample_correlated_gnp.Rd +++ b/man/sample_correlated_gnp.Rd @@ -56,6 +56,7 @@ graph matching for correlated Erdős-Rényi graphs. } \seealso{ Random graph models (games) +\code{\link{bipartite_gnm}()}, \code{\link{erdos.renyi.game}()}, \code{\link{sample_}()}, \code{\link{sample_bipartite}()}, diff --git a/man/sample_correlated_gnp_pair.Rd b/man/sample_correlated_gnp_pair.Rd index 473733336a2..f6ba5cfd959 100644 --- a/man/sample_correlated_gnp_pair.Rd +++ b/man/sample_correlated_gnp_pair.Rd @@ -49,6 +49,7 @@ graph matching for correlated Erdős-Rényi graphs. } \seealso{ Random graph models (games) +\code{\link{bipartite_gnm}()}, \code{\link{erdos.renyi.game}()}, \code{\link{sample_}()}, \code{\link{sample_bipartite}()}, diff --git a/man/sample_degseq.Rd b/man/sample_degseq.Rd index 8000211b9d1..0f381f59d6d 100644 --- a/man/sample_degseq.Rd +++ b/man/sample_degseq.Rd @@ -195,6 +195,7 @@ all(degree(powerlaw_vl_graph) == powerlaw_degrees) \code{\link[=realize_degseq]{realize_degseq()}} for a deterministic variant. Random graph models (games) +\code{\link{bipartite_gnm}()}, \code{\link{erdos.renyi.game}()}, \code{\link{sample_}()}, \code{\link{sample_bipartite}()}, diff --git a/man/sample_dot_product.Rd b/man/sample_dot_product.Rd index e84b56a390a..f658f4e08bd 100644 --- a/man/sample_dot_product.Rd +++ b/man/sample_dot_product.Rd @@ -57,6 +57,7 @@ for social networks. Dissertation, Johns Hopkins University, Maryland, USA, and \code{\link[=sample_sphere_volume]{sample_sphere_volume()}} for sampling position vectors. Random graph models (games) +\code{\link{bipartite_gnm}()}, \code{\link{erdos.renyi.game}()}, \code{\link{sample_}()}, \code{\link{sample_bipartite}()}, diff --git a/man/sample_fitness.Rd b/man/sample_fitness.Rd index f6ab1840d91..6b8c34bf655 100644 --- a/man/sample_fitness.Rd +++ b/man/sample_fitness.Rd @@ -79,6 +79,7 @@ distribution in scale-free networks. \emph{Phys Rev Lett} 87(27):278701, } \seealso{ Random graph models (games) +\code{\link{bipartite_gnm}()}, \code{\link{erdos.renyi.game}()}, \code{\link{sample_}()}, \code{\link{sample_bipartite}()}, diff --git a/man/sample_fitness_pl.Rd b/man/sample_fitness_pl.Rd index 3e092097d34..18e547e3f7e 100644 --- a/man/sample_fitness_pl.Rd +++ b/man/sample_fitness_pl.Rd @@ -88,6 +88,7 @@ scale-free networks under the Achlioptas process. \emph{Phys Rev Lett} } \seealso{ Random graph models (games) +\code{\link{bipartite_gnm}()}, \code{\link{erdos.renyi.game}()}, \code{\link{sample_}()}, \code{\link{sample_bipartite}()}, diff --git a/man/sample_forestfire.Rd b/man/sample_forestfire.Rd index 6d44e99b1e0..1d6c6f9765a 100644 --- a/man/sample_forestfire.Rd +++ b/man/sample_forestfire.Rd @@ -77,6 +77,7 @@ conference on Knowledge discovery in data mining}, 177--187, 2005. model. Random graph models (games) +\code{\link{bipartite_gnm}()}, \code{\link{erdos.renyi.game}()}, \code{\link{sample_}()}, \code{\link{sample_bipartite}()}, diff --git a/man/sample_gnm.Rd b/man/sample_gnm.Rd index 5f71695a37e..aaf6353a42c 100644 --- a/man/sample_gnm.Rd +++ b/man/sample_gnm.Rd @@ -43,6 +43,7 @@ Mathematicae} 6, 290--297 (1959). } \seealso{ Random graph models (games) +\code{\link{bipartite_gnm}()}, \code{\link{erdos.renyi.game}()}, \code{\link{sample_}()}, \code{\link{sample_bipartite}()}, diff --git a/man/sample_gnp.Rd b/man/sample_gnp.Rd index 698f159aa8c..77d1347526d 100644 --- a/man/sample_gnp.Rd +++ b/man/sample_gnp.Rd @@ -54,6 +54,7 @@ Mathematicae} 6, 290--297 (1959). } \seealso{ Random graph models (games) +\code{\link{bipartite_gnm}()}, \code{\link{erdos.renyi.game}()}, \code{\link{sample_}()}, \code{\link{sample_bipartite}()}, diff --git a/man/sample_grg.Rd b/man/sample_grg.Rd index e891532cc9a..335d91b29fc 100644 --- a/man/sample_grg.Rd +++ b/man/sample_grg.Rd @@ -45,6 +45,7 @@ g2 <- sample_grg(1000, 0.05, torus = TRUE) } \seealso{ Random graph models (games) +\code{\link{bipartite_gnm}()}, \code{\link{erdos.renyi.game}()}, \code{\link{sample_}()}, \code{\link{sample_bipartite}()}, diff --git a/man/sample_growing.Rd b/man/sample_growing.Rd index 7621ede2b11..ab7826d489b 100644 --- a/man/sample_growing.Rd +++ b/man/sample_growing.Rd @@ -42,6 +42,7 @@ g2 <- sample_growing(500, citation = TRUE) } \seealso{ Random graph models (games) +\code{\link{bipartite_gnm}()}, \code{\link{erdos.renyi.game}()}, \code{\link{sample_}()}, \code{\link{sample_bipartite}()}, diff --git a/man/sample_hierarchical_sbm.Rd b/man/sample_hierarchical_sbm.Rd index fe5aebc0bb3..48c0ab53d1e 100644 --- a/man/sample_hierarchical_sbm.Rd +++ b/man/sample_hierarchical_sbm.Rd @@ -57,6 +57,7 @@ if (require(Matrix)) { } \seealso{ Random graph models (games) +\code{\link{bipartite_gnm}()}, \code{\link{erdos.renyi.game}()}, \code{\link{sample_}()}, \code{\link{sample_bipartite}()}, diff --git a/man/sample_islands.Rd b/man/sample_islands.Rd index 913e15b40f7..be031b3f023 100644 --- a/man/sample_islands.Rd +++ b/man/sample_islands.Rd @@ -36,6 +36,7 @@ oc \code{\link[=sample_gnp]{sample_gnp()}} Random graph models (games) +\code{\link{bipartite_gnm}()}, \code{\link{erdos.renyi.game}()}, \code{\link{sample_}()}, \code{\link{sample_bipartite}()}, diff --git a/man/sample_k_regular.Rd b/man/sample_k_regular.Rd index 66f2df18760..82583292740 100644 --- a/man/sample_k_regular.Rd +++ b/man/sample_k_regular.Rd @@ -48,6 +48,7 @@ sapply(k10, plot, vertex.label = NA) sequence. Random graph models (games) +\code{\link{bipartite_gnm}()}, \code{\link{erdos.renyi.game}()}, \code{\link{sample_}()}, \code{\link{sample_bipartite}()}, diff --git a/man/sample_last_cit.Rd b/man/sample_last_cit.Rd index ac9b9dc09de..a5a55001a91 100644 --- a/man/sample_last_cit.Rd +++ b/man/sample_last_cit.Rd @@ -80,6 +80,7 @@ vertex only. } \seealso{ Random graph models (games) +\code{\link{bipartite_gnm}()}, \code{\link{erdos.renyi.game}()}, \code{\link{sample_}()}, \code{\link{sample_bipartite}()}, diff --git a/man/sample_pa.Rd b/man/sample_pa.Rd index d50f175ff63..ec8c4f8adaa 100644 --- a/man/sample_pa.Rd +++ b/man/sample_pa.Rd @@ -127,6 +127,7 @@ de Solla Price, D. J. 1965. Networks of Scientific Papers \emph{Science}, } \seealso{ Random graph models (games) +\code{\link{bipartite_gnm}()}, \code{\link{erdos.renyi.game}()}, \code{\link{sample_}()}, \code{\link{sample_bipartite}()}, diff --git a/man/sample_pa_age.Rd b/man/sample_pa_age.Rd index dc7a0b45ae3..598cb93af40 100644 --- a/man/sample_pa_age.Rd +++ b/man/sample_pa_age.Rd @@ -136,6 +136,7 @@ max(degree(g3)) } \seealso{ Random graph models (games) +\code{\link{bipartite_gnm}()}, \code{\link{erdos.renyi.game}()}, \code{\link{sample_}()}, \code{\link{sample_bipartite}()}, diff --git a/man/sample_pref.Rd b/man/sample_pref.Rd index 2b1140ec009..43aadaa2faa 100644 --- a/man/sample_pref.Rd +++ b/man/sample_pref.Rd @@ -99,6 +99,7 @@ tkplot(g, layout = layout_in_circle) } \seealso{ Random graph models (games) +\code{\link{bipartite_gnm}()}, \code{\link{erdos.renyi.game}()}, \code{\link{sample_}()}, \code{\link{sample_bipartite}()}, diff --git a/man/sample_sbm.Rd b/man/sample_sbm.Rd index 9985a7f18a4..c771995ca82 100644 --- a/man/sample_sbm.Rd +++ b/man/sample_sbm.Rd @@ -53,6 +53,7 @@ and evaluation. \emph{Social Networks}, 14, 5--61. } \seealso{ Random graph models (games) +\code{\link{bipartite_gnm}()}, \code{\link{erdos.renyi.game}()}, \code{\link{sample_}()}, \code{\link{sample_bipartite}()}, diff --git a/man/sample_smallworld.Rd b/man/sample_smallworld.Rd index 8bd2e7a815e..28f9adc0b44 100644 --- a/man/sample_smallworld.Rd +++ b/man/sample_smallworld.Rd @@ -65,6 +65,7 @@ Duncan J Watts and Steven H Strogatz: Collective dynamics of \code{\link[=make_lattice]{make_lattice()}}, \code{\link[=rewire]{rewire()}} Random graph models (games) +\code{\link{bipartite_gnm}()}, \code{\link{erdos.renyi.game}()}, \code{\link{sample_}()}, \code{\link{sample_bipartite}()}, diff --git a/man/sample_traits_callaway.Rd b/man/sample_traits_callaway.Rd index 4a5e65ffa06..7d7886783e0 100644 --- a/man/sample_traits_callaway.Rd +++ b/man/sample_traits_callaway.Rd @@ -79,6 +79,7 @@ g2 <- sample_traits(1000, 2, k = 2, pref.matrix = matrix(c(1, 0, 0, 1), ncol = 2 } \seealso{ Random graph models (games) +\code{\link{bipartite_gnm}()}, \code{\link{erdos.renyi.game}()}, \code{\link{sample_}()}, \code{\link{sample_bipartite}()}, diff --git a/man/sample_tree.Rd b/man/sample_tree.Rd index 046ca29e354..a5c600ba8f5 100644 --- a/man/sample_tree.Rd +++ b/man/sample_tree.Rd @@ -37,6 +37,7 @@ g <- sample_tree(100, method = "lerw") } \seealso{ Random graph models (games) +\code{\link{bipartite_gnm}()}, \code{\link{erdos.renyi.game}()}, \code{\link{sample_}()}, \code{\link{sample_bipartite}()}, diff --git a/man/st_cuts.Rd b/man/st_cuts.Rd index d8922a74bcd..d734c2bc2f9 100644 --- a/man/st_cuts.Rd +++ b/man/st_cuts.Rd @@ -34,13 +34,13 @@ removing these edges from \eqn{G} there is no directed path from \eqn{s} to \examples{ # A very simple graph -g <- graph_from_literal(a -+ b -+ c -+ d -+ e) +g <- graph_from_literal(a - +b - +c - +d - +e) st_cuts(g, source = "a", target = "e") # A somewhat more difficult graph g2 <- graph_from_literal( - s --+ a:b, a:b --+ t, - a --+ 1:2:3, 1:2:3 --+ b + s - -+a:b, a:b - -+t, + a - -+1:2:3, 1:2:3 - -+b ) st_cuts(g2, source = "s", target = "t") } diff --git a/man/st_min_cuts.Rd b/man/st_min_cuts.Rd index 111c13a6041..e63aace2b51 100644 --- a/man/st_min_cuts.Rd +++ b/man/st_min_cuts.Rd @@ -49,8 +49,8 @@ An \eqn{(s,t)}-cut is minimum if it is of the smallest possible size. # A difficult graph, from the Provan-Shier paper g <- graph_from_literal( - s --+ a:b, a:b --+ t, - a --+ 1:2:3:4:5, 1:2:3:4:5 --+ b + s - -+a:b, a:b - -+t, + a - -+1:2:3:4:5, 1:2:3:4:5 - -+b ) st_min_cuts(g, source = "s", target = "t") } diff --git a/tools/stimulus/functions-R.yaml b/tools/stimulus/functions-R.yaml index 6054072f113..5a8326acd75 100644 --- a/tools/stimulus/functions-R.yaml +++ b/tools/stimulus/functions-R.yaml @@ -755,10 +755,10 @@ igraph_is_bipartite: DEPS: type ON graph V(graph) igraph_bipartite_game_gnp: - IGNORE: RR + DEPS: types ON graph V(graph) igraph_bipartite_game_gnm: - IGNORE: RR + DEPS: types ON graph V(graph) igraph_bipartite_game: IGNORE: RR, RC From 6604954d9008e055830f1c6893acefecfad6a6ee Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?Ma=C3=ABlle=20Salmon?= Date: Wed, 19 Feb 2025 12:09:33 +0100 Subject: [PATCH 2/8] fix note --- R/games.R | 1 + 1 file changed, 1 insertion(+) diff --git a/R/games.R b/R/games.R index 2df97d89d7b..ecdfde76f89 100644 --- a/R/games.R +++ b/R/games.R @@ -1768,6 +1768,7 @@ sample_bipartite <- function(n1, n2, type = c("gnp", "gnm"), p, m, } } +utils::globalVariables("type") #' @rdname sample_bipartite #' @param ... Passed to `sample_bipartite()`. #' @export From b9f64d1b95938f5905b2646b54f860a226c19c85 Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?Ma=C3=ABlle=20Salmon?= Date: Fri, 28 Feb 2025 15:46:57 +0100 Subject: [PATCH 3/8] Apply suggestions from code review MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit Co-authored-by: Kirill Müller --- R/games.R | 6 +++--- 1 file changed, 3 insertions(+), 3 deletions(-) diff --git a/R/games.R b/R/games.R index ecdfde76f89..9b8979809de 100644 --- a/R/games.R +++ b/R/games.R @@ -1753,14 +1753,14 @@ sample_bipartite <- function(n1, n2, type = c("gnp", "gnm"), p, m, if (type == "gnp") { lifecycle::deprecate_soft( - "2.1.3", + "2.2.0", "sample_bipartite()", "sample_bipartite_gnp()" ) sample_bipartite_gnp(n1, n2, p, directed = directed, mode = mode) } else if (type == "gnm") { lifecycle::deprecate_soft( - "2.1.3", + "2.2.0", "sample_bipartite()", "sample_bipartite_gnm()" ) @@ -1772,7 +1772,7 @@ utils::globalVariables("type") #' @rdname sample_bipartite #' @param ... Passed to `sample_bipartite()`. #' @export -bipartite <- function(...) { +bipartite <- function(..., type = NULL) { if (!rlang::is_missing(type) && type == "gnp") { lifecycle::deprecate_soft( From 63555be9b63f8db225a8055f66b6c43083eef1fa Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?Ma=C3=ABlle=20Salmon?= Date: Fri, 28 Feb 2025 16:01:45 +0100 Subject: [PATCH 4/8] tweaks --- R/games.R | 10 +++++++--- man/are_adjacent.Rd | 2 +- man/articulation_points.Rd | 2 +- man/as_directed.Rd | 2 +- man/assortativity.Rd | 2 +- man/automorphism_group.Rd | 2 +- man/biconnected_components.Rd | 2 +- man/bipartite_mapping.Rd | 2 +- man/bipartite_projection.Rd | 2 +- man/canonical_permutation.Rd | 2 +- man/centr_betw_tmax.Rd | 2 +- man/centr_clo.Rd | 2 +- man/centr_clo_tmax.Rd | 2 +- man/centr_degree.Rd | 2 +- man/centr_eigen.Rd | 2 +- man/centr_eigen_tmax.Rd | 2 +- man/centralize.Rd | 2 +- man/cliques.Rd | 2 +- man/components.Rd | 2 +- man/consensus_tree.Rd | 2 +- man/contract.Rd | 2 +- man/convex_hull.Rd | 2 +- man/count_automorphisms.Rd | 2 +- man/count_triangles.Rd | 2 +- man/degree.Rd | 2 +- man/dim_select.Rd | 2 +- man/distances.Rd | 2 +- man/diversity.Rd | 2 +- man/dyad_census.Rd | 2 +- man/eccentricity.Rd | 2 +- man/edge_density.Rd | 2 +- man/eigen_centrality.Rd | 2 +- man/embed_adjacency_matrix.Rd | 2 +- man/embed_laplacian_matrix.Rd | 2 +- man/feedback_arc_set.Rd | 2 +- man/global_efficiency.Rd | 2 +- man/gorder.Rd | 2 +- man/graph.lattice.Rd | 2 +- man/graph_center.Rd | 2 +- man/graph_from_adj_list.Rd | 2 +- man/graph_from_isomorphism_class.Rd | 2 +- man/graph_from_lcf.Rd | 2 +- man/graphlet_basis.Rd | 2 +- man/greedy_vertex_coloring.Rd | 2 +- man/harmonic_centrality.Rd | 2 +- man/has_eulerian_path.Rd | 2 +- man/hits_scores.Rd | 2 +- man/hrg.Rd | 2 +- man/hrg_tree.Rd | 2 +- man/is_acyclic.Rd | 2 +- man/is_biconnected.Rd | 2 +- man/is_dag.Rd | 2 +- man/is_forest.Rd | 2 +- man/is_graphical.Rd | 2 +- man/is_min_separator.Rd | 2 +- man/is_separator.Rd | 2 +- man/is_tree.Rd | 2 +- man/k_shortest_paths.Rd | 2 +- man/knn.Rd | 2 +- man/laplacian_matrix.Rd | 2 +- man/make_empty_graph.Rd | 2 +- man/make_from_prufer.Rd | 2 +- man/make_lattice.Rd | 2 +- man/max_cardinality.Rd | 2 +- man/max_flow.Rd | 2 +- man/min_separators.Rd | 2 +- man/min_st_separators.Rd | 2 +- man/page_rank.Rd | 2 +- man/permute.Rd | 2 +- man/radius.Rd | 2 +- man/random_walk.Rd | 2 +- man/read_graph.Rd | 2 +- man/realize_bipartite_degseq.Rd | 2 +- man/realize_degseq.Rd | 2 +- man/reciprocity.Rd | 2 +- man/reverse_edges.Rd | 2 +- man/sample_bipartite.Rd | 2 +- man/sample_chung_lu.Rd | 2 +- man/sample_correlated_gnp.Rd | 2 +- man/sample_correlated_gnp_pair.Rd | 2 +- man/sample_dot_product.Rd | 2 +- man/sample_fitness.Rd | 2 +- man/sample_fitness_pl.Rd | 2 +- man/sample_forestfire.Rd | 2 +- man/sample_growing.Rd | 2 +- man/sample_hierarchical_sbm.Rd | 2 +- man/sample_hrg.Rd | 2 +- man/sample_islands.Rd | 2 +- man/sample_k_regular.Rd | 2 +- man/sample_sbm.Rd | 2 +- man/sample_spanning_tree.Rd | 2 +- man/sample_tree.Rd | 2 +- man/similarity.Rd | 2 +- man/simplify.Rd | 2 +- man/sir.Rd | 2 +- man/st_cuts.Rd | 2 +- man/st_min_cuts.Rd | 2 +- man/strength.Rd | 2 +- man/to_prufer.Rd | 2 +- man/triad_census.Rd | 2 +- man/voronoi_cells.Rd | 2 +- man/weighted_cliques.Rd | 2 +- man/which_multiple.Rd | 2 +- man/which_mutual.Rd | 2 +- man/write_graph.Rd | 2 +- 105 files changed, 111 insertions(+), 107 deletions(-) diff --git a/R/games.R b/R/games.R index 9b8979809de..1d0f7d26b59 100644 --- a/R/games.R +++ b/R/games.R @@ -1768,26 +1768,30 @@ sample_bipartite <- function(n1, n2, type = c("gnp", "gnm"), p, m, } } -utils::globalVariables("type") #' @rdname sample_bipartite #' @param ... Passed to `sample_bipartite()`. #' @export bipartite <- function(..., type = NULL) { - if (!rlang::is_missing(type) && type == "gnp") { + if (is.null(type) || type == "gnp") { lifecycle::deprecate_soft( "2.1.3", "bipartite()", "bipartite_gnp()" ) bipartite_gnp(...) - } else if (!rlang::is_missing(type) && type == "gnm") { + } else if (type == "gnm") { lifecycle::deprecate_soft( "2.1.3", "bipartite()", "bipartite_gnm()" ) bipartite_gnm(...) + } else { + cli::cli_abort( + "{.arg type} must be 'gnp' or 'gnm'.", + "Use {.fun bipartite_gnp} or {.fun bipartite_gnm}." + ) } } diff --git a/man/are_adjacent.Rd b/man/are_adjacent.Rd index 56843838e5b..8a57057f4e6 100644 --- a/man/are_adjacent.Rd +++ b/man/are_adjacent.Rd @@ -48,5 +48,5 @@ Other structural queries: \code{\link{tail_of}()} } \concept{structural queries} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_are_adjacent}{\code{igraph_are_adjacent()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_are_adjacent}{\code{are_adjacent()}}.} diff --git a/man/articulation_points.Rd b/man/articulation_points.Rd index 124b1d6bd03..91016495ccb 100644 --- a/man/articulation_points.Rd +++ b/man/articulation_points.Rd @@ -57,5 +57,5 @@ Gabor Csardi \email{csardi.gabor@gmail.com} } \concept{components} \keyword{graphs} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_articulation_points}{\code{igraph_articulation_points()}}, \href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_bridges}{\code{igraph_bridges()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_articulation_points}{\code{articulation_points()}}, \href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_bridges}{\code{bridges()}}.} diff --git a/man/as_directed.Rd b/man/as_directed.Rd index e8a1ee31ba5..729363ba44b 100644 --- a/man/as_directed.Rd +++ b/man/as_directed.Rd @@ -118,5 +118,5 @@ Gabor Csardi \email{csardi.gabor@gmail.com} } \concept{conversion} \keyword{graphs} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_to_directed}{\code{igraph_to_directed()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_to_directed}{\code{to_directed()}}.} diff --git a/man/assortativity.Rd b/man/assortativity.Rd index 303326ef579..038771a866a 100644 --- a/man/assortativity.Rd +++ b/man/assortativity.Rd @@ -126,5 +126,5 @@ M. E. J. Newman: Assortative mixing in networks, \emph{Phys. Rev. Lett.} 89, Gabor Csardi \email{csardi.gabor@gmail.com} } \keyword{graphs} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_assortativity}{\code{igraph_assortativity()}}, \href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_assortativity_nominal}{\code{igraph_assortativity_nominal()}}, \href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_assortativity_degree}{\code{igraph_assortativity_degree()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_assortativity}{\code{assortativity()}}, \href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_assortativity_nominal}{\code{assortativity_nominal()}}, \href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_assortativity_degree}{\code{assortativity_degree()}}.} diff --git a/man/automorphism_group.Rd b/man/automorphism_group.Rd index 7ac6ea08ddf..b6c9c94f2de 100644 --- a/man/automorphism_group.Rd +++ b/man/automorphism_group.Rd @@ -83,5 +83,5 @@ Tamas Nepusz \email{ntamas@gmail.com} for this manual page. } \concept{graph automorphism} \keyword{graphs} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Isomorphism.html#igraph_automorphism_group}{\code{igraph_automorphism_group()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Isomorphism.html#igraph_automorphism_group}{\code{automorphism_group()}}.} diff --git a/man/biconnected_components.Rd b/man/biconnected_components.Rd index b69f2fbe7b1..6abf99f79d5 100644 --- a/man/biconnected_components.Rd +++ b/man/biconnected_components.Rd @@ -56,5 +56,5 @@ Gabor Csardi \email{csardi.gabor@gmail.com} } \concept{components} \keyword{graphs} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_biconnected_components}{\code{igraph_biconnected_components()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_biconnected_components}{\code{biconnected_components()}}.} diff --git a/man/bipartite_mapping.Rd b/man/bipartite_mapping.Rd index c6974de72fe..785a0304841 100644 --- a/man/bipartite_mapping.Rd +++ b/man/bipartite_mapping.Rd @@ -61,5 +61,5 @@ Gabor Csardi \email{csardi.gabor@gmail.com} } \concept{bipartite} \keyword{graphs} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Bipartite.html#igraph_is_bipartite}{\code{igraph_is_bipartite()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Bipartite.html#igraph_is_bipartite}{\code{is_bipartite()}}.} diff --git a/man/bipartite_projection.Rd b/man/bipartite_projection.Rd index 6c15c2270c6..7dbc2a65cc8 100644 --- a/man/bipartite_projection.Rd +++ b/man/bipartite_projection.Rd @@ -100,5 +100,5 @@ Gabor Csardi \email{csardi.gabor@gmail.com} } \concept{bipartite} \keyword{graphs} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Bipartite.html#igraph_bipartite_projection_size}{\code{igraph_bipartite_projection_size()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Bipartite.html#igraph_bipartite_projection_size}{\code{bipartite_projection_size()}}.} diff --git a/man/canonical_permutation.Rd b/man/canonical_permutation.Rd index 9da7fe458c3..70840add231 100644 --- a/man/canonical_permutation.Rd +++ b/man/canonical_permutation.Rd @@ -105,5 +105,5 @@ Tommi Junttila for BLISS, Gabor Csardi } \concept{graph isomorphism} \keyword{graphs} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Isomorphism.html#igraph_canonical_permutation}{\code{igraph_canonical_permutation()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Isomorphism.html#igraph_canonical_permutation}{\code{canonical_permutation()}}.} diff --git a/man/centr_betw_tmax.Rd b/man/centr_betw_tmax.Rd index 9ec4170e22b..8341178531d 100644 --- a/man/centr_betw_tmax.Rd +++ b/man/centr_betw_tmax.Rd @@ -44,5 +44,5 @@ Other centralization related: \code{\link{centralize}()} } \concept{centralization related} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_centralization_betweenness_tmax}{\code{igraph_centralization_betweenness_tmax()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_centralization_betweenness_tmax}{\code{centralization_betweenness_tmax()}}.} diff --git a/man/centr_clo.Rd b/man/centr_clo.Rd index 085dc9e662a..378ea6d3242 100644 --- a/man/centr_clo.Rd +++ b/man/centr_clo.Rd @@ -47,5 +47,5 @@ Other centralization related: \code{\link{centralize}()} } \concept{centralization related} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_centralization_closeness}{\code{igraph_centralization_closeness()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_centralization_closeness}{\code{centralization_closeness()}}.} diff --git a/man/centr_clo_tmax.Rd b/man/centr_clo_tmax.Rd index 1f047ff9cf7..91abfd3e694 100644 --- a/man/centr_clo_tmax.Rd +++ b/man/centr_clo_tmax.Rd @@ -43,5 +43,5 @@ Other centralization related: \code{\link{centralize}()} } \concept{centralization related} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_centralization_closeness_tmax}{\code{igraph_centralization_closeness_tmax()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_centralization_closeness_tmax}{\code{centralization_closeness_tmax()}}.} diff --git a/man/centr_degree.Rd b/man/centr_degree.Rd index e7189a6b988..1ed1d52ac88 100644 --- a/man/centr_degree.Rd +++ b/man/centr_degree.Rd @@ -55,5 +55,5 @@ Other centralization related: \code{\link{centralize}()} } \concept{centralization related} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_centralization_degree}{\code{igraph_centralization_degree()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_centralization_degree}{\code{centralization_degree()}}.} diff --git a/man/centr_eigen.Rd b/man/centr_eigen.Rd index f3efd322948..9f29386284e 100644 --- a/man/centr_eigen.Rd +++ b/man/centr_eigen.Rd @@ -66,5 +66,5 @@ Other centralization related: \code{\link{centralize}()} } \concept{centralization related} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_centralization_eigenvector_centrality}{\code{igraph_centralization_eigenvector_centrality()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_centralization_eigenvector_centrality}{\code{centralization_eigenvector_centrality()}}.} diff --git a/man/centr_eigen_tmax.Rd b/man/centr_eigen_tmax.Rd index a1e2760bfa8..bc52861c31e 100644 --- a/man/centr_eigen_tmax.Rd +++ b/man/centr_eigen_tmax.Rd @@ -46,5 +46,5 @@ Other centralization related: \code{\link{centralize}()} } \concept{centralization related} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_centralization_eigenvector_centrality_tmax}{\code{igraph_centralization_eigenvector_centrality_tmax()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_centralization_eigenvector_centrality_tmax}{\code{centralization_eigenvector_centrality_tmax()}}.} diff --git a/man/centralize.Rd b/man/centralize.Rd index 10060780217..134db123a5b 100644 --- a/man/centralize.Rd +++ b/man/centralize.Rd @@ -84,5 +84,5 @@ Other centralization related: \code{\link{centr_eigen_tmax}()} } \concept{centralization related} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_centralization}{\code{igraph_centralization()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_centralization}{\code{centralization()}}.} diff --git a/man/cliques.Rd b/man/cliques.Rd index 4f422b38d80..278ca805830 100644 --- a/man/cliques.Rd +++ b/man/cliques.Rd @@ -125,5 +125,5 @@ Tamas Nepusz \email{ntamas@gmail.com} and Gabor Csardi } \concept{cliques} \keyword{graphs} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Cliques.html#igraph_cliques}{\code{igraph_cliques()}}, \href{https://igraph.org/c/html/latest/igraph-Cliques.html#igraph_largest_cliques}{\code{igraph_largest_cliques()}}, \href{https://igraph.org/c/html/latest/igraph-Cliques.html#igraph_clique_number}{\code{igraph_clique_number()}}, \href{https://igraph.org/c/html/latest/igraph-Cliques.html#igraph_largest_weighted_cliques}{\code{igraph_largest_weighted_cliques()}}, \href{https://igraph.org/c/html/latest/igraph-Cliques.html#igraph_weighted_clique_number}{\code{igraph_weighted_clique_number()}}, \href{https://igraph.org/c/html/latest/igraph-Cliques.html#igraph_maximal_cliques_hist}{\code{igraph_maximal_cliques_hist()}}, \href{https://igraph.org/c/html/latest/igraph-Cliques.html#igraph_clique_size_hist}{\code{igraph_clique_size_hist()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Cliques.html#igraph_cliques}{\code{cliques()}}, \href{https://igraph.org/c/html/latest/igraph-Cliques.html#igraph_largest_cliques}{\code{largest_cliques()}}, \href{https://igraph.org/c/html/latest/igraph-Cliques.html#igraph_clique_number}{\code{clique_number()}}, \href{https://igraph.org/c/html/latest/igraph-Cliques.html#igraph_largest_weighted_cliques}{\code{largest_weighted_cliques()}}, \href{https://igraph.org/c/html/latest/igraph-Cliques.html#igraph_weighted_clique_number}{\code{weighted_clique_number()}}, \href{https://igraph.org/c/html/latest/igraph-Cliques.html#igraph_maximal_cliques_hist}{\code{maximal_cliques_hist()}}, \href{https://igraph.org/c/html/latest/igraph-Cliques.html#igraph_clique_size_hist}{\code{clique_size_hist()}}.} diff --git a/man/components.Rd b/man/components.Rd index 9db9505734b..05bf72cbcce 100644 --- a/man/components.Rd +++ b/man/components.Rd @@ -123,5 +123,5 @@ Gabor Csardi \email{csardi.gabor@gmail.com} \concept{components} \concept{structural.properties} \keyword{graphs} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_is_connected}{\code{igraph_is_connected()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_is_connected}{\code{is_connected()}}.} diff --git a/man/consensus_tree.Rd b/man/consensus_tree.Rd index be44cf91604..fc0442cae19 100644 --- a/man/consensus_tree.Rd +++ b/man/consensus_tree.Rd @@ -52,5 +52,5 @@ Other hierarchical random graph functions: \code{\link{sample_hrg}()} } \concept{hierarchical random graph functions} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-HRG.html#igraph_hrg_consensus}{\code{igraph_hrg_consensus()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-HRG.html#igraph_hrg_consensus}{\code{hrg_consensus()}}.} diff --git a/man/contract.Rd b/man/contract.Rd index 9b4ca036d96..e76972702aa 100644 --- a/man/contract.Rd +++ b/man/contract.Rd @@ -75,5 +75,5 @@ Gabor Csardi \email{csardi.gabor@gmail.com} } \concept{functions for manipulating graph structure} \keyword{graphs} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Operators.html#igraph_contract_vertices}{\code{igraph_contract_vertices()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Operators.html#igraph_contract_vertices}{\code{contract_vertices()}}.} diff --git a/man/convex_hull.Rd b/man/convex_hull.Rd index bf7d0e29ffc..4c244221cb5 100644 --- a/man/convex_hull.Rd +++ b/man/convex_hull.Rd @@ -39,5 +39,5 @@ Tamas Nepusz \email{ntamas@gmail.com} } \concept{other} \keyword{graphs} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Nongraph.html#igraph_convex_hull}{\code{igraph_convex_hull()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Nongraph.html#igraph_convex_hull}{\code{convex_hull()}}.} diff --git a/man/count_automorphisms.Rd b/man/count_automorphisms.Rd index 89b5ce7fa9b..4726b01170a 100644 --- a/man/count_automorphisms.Rd +++ b/man/count_automorphisms.Rd @@ -84,5 +84,5 @@ and this manual page. } \concept{graph automorphism} \keyword{graphs} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Isomorphism.html#igraph_count_automorphisms}{\code{igraph_count_automorphisms()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Isomorphism.html#igraph_count_automorphisms}{\code{count_automorphisms()}}.} diff --git a/man/count_triangles.Rd b/man/count_triangles.Rd index bb84c388c5a..8db87f9e930 100644 --- a/man/count_triangles.Rd +++ b/man/count_triangles.Rd @@ -63,5 +63,5 @@ Gabor Csardi \email{csardi.gabor@gmail.com} } \concept{triangles} \keyword{graphs} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Motifs.html#igraph_list_triangles}{\code{igraph_list_triangles()}}, \href{https://igraph.org/c/html/latest/igraph-Motifs.html#igraph_adjacent_triangles}{\code{igraph_adjacent_triangles()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Motifs.html#igraph_list_triangles}{\code{list_triangles()}}, \href{https://igraph.org/c/html/latest/igraph-Motifs.html#igraph_adjacent_triangles}{\code{adjacent_triangles()}}.} diff --git a/man/degree.Rd b/man/degree.Rd index 6292374fc2b..e608495a439 100644 --- a/man/degree.Rd +++ b/man/degree.Rd @@ -100,5 +100,5 @@ Gabor Csardi \email{csardi.gabor@gmail.com} } \concept{structural.properties} \keyword{graphs} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_maxdegree}{\code{igraph_maxdegree()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_maxdegree}{\code{maxdegree()}}.} diff --git a/man/dim_select.Rd b/man/dim_select.Rd index 7752d085a4a..bbaa569d30f 100644 --- a/man/dim_select.Rd +++ b/man/dim_select.Rd @@ -78,5 +78,5 @@ Gabor Csardi \email{csardi.gabor@gmail.com} } \concept{embedding} \keyword{graphs} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Embedding.html#igraph_dim_select}{\code{igraph_dim_select()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Embedding.html#igraph_dim_select}{\code{dim_select()}}.} diff --git a/man/distances.Rd b/man/distances.Rd index 36a86e62ddf..4eb66a1036c 100644 --- a/man/distances.Rd +++ b/man/distances.Rd @@ -301,5 +301,5 @@ Gabor Csardi \email{csardi.gabor@gmail.com} \concept{paths} \concept{structural.properties} \keyword{graphs} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_path_length_hist}{\code{igraph_path_length_hist()}}, \href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_average_path_length_dijkstra}{\code{igraph_average_path_length_dijkstra()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_path_length_hist}{\code{path_length_hist()}}, \href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_average_path_length_dijkstra}{\code{average_path_length_dijkstra()}}.} diff --git a/man/diversity.Rd b/man/diversity.Rd index 5d11096e80e..570b68a7de6 100644 --- a/man/diversity.Rd +++ b/man/diversity.Rd @@ -71,5 +71,5 @@ Gabor Csardi \email{csardi.gabor@gmail.com} } \concept{centrality} \keyword{graphs} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_diversity}{\code{igraph_diversity()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_diversity}{\code{diversity()}}.} diff --git a/man/dyad_census.Rd b/man/dyad_census.Rd index fc52460a561..4f6ef6186fc 100644 --- a/man/dyad_census.Rd +++ b/man/dyad_census.Rd @@ -47,5 +47,5 @@ Gabor Csardi \email{csardi.gabor@gmail.com} } \concept{graph motifs} \keyword{graphs} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Motifs.html#igraph_dyad_census}{\code{igraph_dyad_census()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Motifs.html#igraph_dyad_census}{\code{dyad_census()}}.} diff --git a/man/eccentricity.Rd b/man/eccentricity.Rd index 6534da42be0..a4678a78d2d 100644 --- a/man/eccentricity.Rd +++ b/man/eccentricity.Rd @@ -68,5 +68,5 @@ Other paths: \code{\link{radius}()} } \concept{paths} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_eccentricity_dijkstra}{\code{igraph_eccentricity_dijkstra()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_eccentricity_dijkstra}{\code{eccentricity_dijkstra()}}.} diff --git a/man/edge_density.Rd b/man/edge_density.Rd index ddbaf008e57..6f70664849a 100644 --- a/man/edge_density.Rd +++ b/man/edge_density.Rd @@ -79,5 +79,5 @@ Gabor Csardi \email{csardi.gabor@gmail.com} } \concept{structural.properties} \keyword{graphs} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_density}{\code{igraph_density()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_density}{\code{density()}}.} diff --git a/man/eigen_centrality.Rd b/man/eigen_centrality.Rd index 6945c2bd970..9901e4f54ec 100644 --- a/man/eigen_centrality.Rd +++ b/man/eigen_centrality.Rd @@ -122,5 +122,5 @@ manual page. } \concept{centrality} \keyword{graphs} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_eigenvector_centrality}{\code{igraph_eigenvector_centrality()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_eigenvector_centrality}{\code{eigenvector_centrality()}}.} diff --git a/man/embed_adjacency_matrix.Rd b/man/embed_adjacency_matrix.Rd index 6bb0d299d86..edb0a9dba87 100644 --- a/man/embed_adjacency_matrix.Rd +++ b/man/embed_adjacency_matrix.Rd @@ -100,5 +100,5 @@ Other embedding: } \concept{embedding} \keyword{graphs} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Embedding.html#igraph_adjacency_spectral_embedding}{\code{igraph_adjacency_spectral_embedding()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Embedding.html#igraph_adjacency_spectral_embedding}{\code{adjacency_spectral_embedding()}}.} diff --git a/man/embed_laplacian_matrix.Rd b/man/embed_laplacian_matrix.Rd index 89672f6623b..885202c372c 100644 --- a/man/embed_laplacian_matrix.Rd +++ b/man/embed_laplacian_matrix.Rd @@ -110,5 +110,5 @@ Gabor Csardi \email{csardi.gabor@gmail.com} } \concept{embedding} \keyword{graphs} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Embedding.html#igraph_laplacian_spectral_embedding}{\code{igraph_laplacian_spectral_embedding()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Embedding.html#igraph_laplacian_spectral_embedding}{\code{laplacian_spectral_embedding()}}.} diff --git a/man/feedback_arc_set.Rd b/man/feedback_arc_set.Rd index fdc6fae4b1a..557908d4adc 100644 --- a/man/feedback_arc_set.Rd +++ b/man/feedback_arc_set.Rd @@ -84,5 +84,5 @@ Graph cycles \concept{cycles} \concept{structural.properties} \keyword{graphs} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_feedback_arc_set}{\code{igraph_feedback_arc_set()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_feedback_arc_set}{\code{feedback_arc_set()}}.} diff --git a/man/global_efficiency.Rd b/man/global_efficiency.Rd index 3e9758e8bc9..c2bff5b8b62 100644 --- a/man/global_efficiency.Rd +++ b/man/global_efficiency.Rd @@ -104,5 +104,5 @@ transfer in regular and complex networks, Phys. Rev. E 71, 1 (2005). } \concept{efficiency} \keyword{graphs} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_global_efficiency}{\code{igraph_global_efficiency()}}, \href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_local_efficiency}{\code{igraph_local_efficiency()}}, \href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_average_local_efficiency}{\code{igraph_average_local_efficiency()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_global_efficiency}{\code{global_efficiency()}}, \href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_local_efficiency}{\code{local_efficiency()}}, \href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_average_local_efficiency}{\code{average_local_efficiency()}}.} diff --git a/man/gorder.Rd b/man/gorder.Rd index 407d273fd05..afe05c576a4 100644 --- a/man/gorder.Rd +++ b/man/gorder.Rd @@ -40,5 +40,5 @@ Other structural queries: \code{\link{tail_of}()} } \concept{structural queries} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Basic.html#igraph_vcount}{\code{igraph_vcount()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Basic.html#igraph_vcount}{\code{vcount()}}.} diff --git a/man/graph.lattice.Rd b/man/graph.lattice.Rd index a7b0ed502ff..0435ebc7468 100644 --- a/man/graph.lattice.Rd +++ b/man/graph.lattice.Rd @@ -45,5 +45,5 @@ be extended to boolean vector with dimvector length.} consistent API. } \keyword{internal} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Generators.html#igraph_square_lattice}{\code{igraph_square_lattice()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Generators.html#igraph_square_lattice}{\code{square_lattice()}}.} diff --git a/man/graph_center.Rd b/man/graph_center.Rd index 92ff4cac8d8..edaa1075a6e 100644 --- a/man/graph_center.Rd +++ b/man/graph_center.Rd @@ -57,5 +57,5 @@ Other paths: \code{\link{radius}()} } \concept{paths} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_graph_center_dijkstra}{\code{igraph_graph_center_dijkstra()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_graph_center_dijkstra}{\code{graph_center_dijkstra()}}.} diff --git a/man/graph_from_adj_list.Rd b/man/graph_from_adj_list.Rd index 0ef1bd43ba8..f3881bdf42a 100644 --- a/man/graph_from_adj_list.Rd +++ b/man/graph_from_adj_list.Rd @@ -82,5 +82,5 @@ Gabor Csardi \email{csardi.gabor@gmail.com} } \concept{conversion} \keyword{graphs} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Generators.html#igraph_adjlist}{\code{igraph_adjlist()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Generators.html#igraph_adjlist}{\code{adjlist()}}.} diff --git a/man/graph_from_isomorphism_class.Rd b/man/graph_from_isomorphism_class.Rd index 554e7ffe698..0a74cf482b3 100644 --- a/man/graph_from_isomorphism_class.Rd +++ b/man/graph_from_isomorphism_class.Rd @@ -36,5 +36,5 @@ Other graph isomorphism: \code{\link{subgraph_isomorphisms}()} } \concept{graph isomorphism} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Isomorphism.html#igraph_isoclass_create}{\code{igraph_isoclass_create()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Isomorphism.html#igraph_isoclass_create}{\code{isoclass_create()}}.} diff --git a/man/graph_from_lcf.Rd b/man/graph_from_lcf.Rd index f5c52bef2b1..2ae9978e599 100644 --- a/man/graph_from_lcf.Rd +++ b/man/graph_from_lcf.Rd @@ -39,5 +39,5 @@ functions on the its manual page for creating special graphs. Gabor Csardi \email{csardi.gabor@gmail.com} } \keyword{graphs} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Generators.html#igraph_lcf_vector}{\code{igraph_lcf_vector()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Generators.html#igraph_lcf_vector}{\code{lcf_vector()}}.} diff --git a/man/graphlet_basis.Rd b/man/graphlet_basis.Rd index 2cf18b2cc6e..4971d8fa668 100644 --- a/man/graphlet_basis.Rd +++ b/man/graphlet_basis.Rd @@ -103,5 +103,5 @@ for (i in 1:length(gl$cliques)) { } } \concept{glet} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Graphlets.html#igraph_graphlets}{\code{igraph_graphlets()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Graphlets.html#igraph_graphlets}{\code{graphlets()}}.} diff --git a/man/greedy_vertex_coloring.Rd b/man/greedy_vertex_coloring.Rd index d6cf2ad5086..234169f164a 100644 --- a/man/greedy_vertex_coloring.Rd +++ b/man/greedy_vertex_coloring.Rd @@ -42,5 +42,5 @@ plot(g, vertex.color = col) } \concept{coloring} \keyword{graphs} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Coloring.html#igraph_vertex_coloring_greedy}{\code{igraph_vertex_coloring_greedy()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Coloring.html#igraph_vertex_coloring_greedy}{\code{vertex_coloring_greedy()}}.} diff --git a/man/harmonic_centrality.Rd b/man/harmonic_centrality.Rd index d6f7944adda..c70629c847d 100644 --- a/man/harmonic_centrality.Rd +++ b/man/harmonic_centrality.Rd @@ -85,5 +85,5 @@ Centrality measures } \concept{centrality} \keyword{graphs} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_harmonic_centrality_cutoff}{\code{igraph_harmonic_centrality_cutoff()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_harmonic_centrality_cutoff}{\code{harmonic_centrality_cutoff()}}.} diff --git a/man/has_eulerian_path.Rd b/man/has_eulerian_path.Rd index 275cf63241b..43e350f6831 100644 --- a/man/has_eulerian_path.Rd +++ b/man/has_eulerian_path.Rd @@ -65,5 +65,5 @@ Graph cycles } \concept{cycles} \keyword{graphs} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Cycles.html#igraph_is_eulerian}{\code{igraph_is_eulerian()}}, \href{https://igraph.org/c/html/latest/igraph-Cycles.html#igraph_eulerian_path}{\code{igraph_eulerian_path()}}, \href{https://igraph.org/c/html/latest/igraph-Cycles.html#igraph_eulerian_cycle}{\code{igraph_eulerian_cycle()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Cycles.html#igraph_is_eulerian}{\code{is_eulerian()}}, \href{https://igraph.org/c/html/latest/igraph-Cycles.html#igraph_eulerian_path}{\code{eulerian_path()}}, \href{https://igraph.org/c/html/latest/igraph-Cycles.html#igraph_eulerian_cycle}{\code{eulerian_cycle()}}.} diff --git a/man/hits_scores.Rd b/man/hits_scores.Rd index f216a6ab66c..021af815582 100644 --- a/man/hits_scores.Rd +++ b/man/hits_scores.Rd @@ -89,5 +89,5 @@ Centrality measures \code{\link{subgraph_centrality}()} } \concept{centrality} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_hub_and_authority_scores}{\code{igraph_hub_and_authority_scores()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_hub_and_authority_scores}{\code{hub_and_authority_scores()}}.} diff --git a/man/hrg.Rd b/man/hrg.Rd index 587a07bf52c..4eff251cef8 100644 --- a/man/hrg.Rd +++ b/man/hrg.Rd @@ -33,5 +33,5 @@ Other hierarchical random graph functions: \code{\link{sample_hrg}()} } \concept{hierarchical random graph functions} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-HRG.html#igraph_hrg_create}{\code{igraph_hrg_create()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-HRG.html#igraph_hrg_create}{\code{hrg_create()}}.} diff --git a/man/hrg_tree.Rd b/man/hrg_tree.Rd index 212f961e044..e3dcca5003b 100644 --- a/man/hrg_tree.Rd +++ b/man/hrg_tree.Rd @@ -28,5 +28,5 @@ Other hierarchical random graph functions: \code{\link{sample_hrg}()} } \concept{hierarchical random graph functions} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-HRG.html#igraph_from_hrg_dendrogram}{\code{igraph_from_hrg_dendrogram()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-HRG.html#igraph_from_hrg_dendrogram}{\code{from_hrg_dendrogram()}}.} diff --git a/man/is_acyclic.Rd b/man/is_acyclic.Rd index c00977d8c7e..fd6d4c24803 100644 --- a/man/is_acyclic.Rd +++ b/man/is_acyclic.Rd @@ -63,5 +63,5 @@ Other structural.properties: \concept{cycles} \concept{structural.properties} \keyword{graphs} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_is_acyclic}{\code{igraph_is_acyclic()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_is_acyclic}{\code{is_acyclic()}}.} diff --git a/man/is_biconnected.Rd b/man/is_biconnected.Rd index 537d064a257..16f847b1bae 100644 --- a/man/is_biconnected.Rd +++ b/man/is_biconnected.Rd @@ -44,5 +44,5 @@ Connected components } \concept{components} \keyword{graphs} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_is_biconnected}{\code{igraph_is_biconnected()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_is_biconnected}{\code{is_biconnected()}}.} diff --git a/man/is_dag.Rd b/man/is_dag.Rd index 8391020f743..48779ade508 100644 --- a/man/is_dag.Rd +++ b/man/is_dag.Rd @@ -67,5 +67,5 @@ Tamas Nepusz \email{ntamas@gmail.com} for the C code, Gabor Csardi \concept{cycles} \concept{structural.properties} \keyword{graphs} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_is_dag}{\code{igraph_is_dag()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_is_dag}{\code{is_dag()}}.} diff --git a/man/is_forest.Rd b/man/is_forest.Rd index ab518ddb017..dd6315476e0 100644 --- a/man/is_forest.Rd +++ b/man/is_forest.Rd @@ -54,5 +54,5 @@ Other trees: } \concept{trees} \keyword{graphs} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_is_forest}{\code{igraph_is_forest()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_is_forest}{\code{is_forest()}}.} diff --git a/man/is_graphical.Rd b/man/is_graphical.Rd index 7668903810c..6c10001c9be 100644 --- a/man/is_graphical.Rd +++ b/man/is_graphical.Rd @@ -58,5 +58,5 @@ Tamás Nepusz \email{ntamas@gmail.com} } \concept{graphical degree sequences} \keyword{graphs} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_is_graphical}{\code{igraph_is_graphical()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_is_graphical}{\code{is_graphical()}}.} diff --git a/man/is_min_separator.Rd b/man/is_min_separator.Rd index 15578afaf3f..69bc91bdcd1 100644 --- a/man/is_min_separator.Rd +++ b/man/is_min_separator.Rd @@ -69,5 +69,5 @@ Other flow: \code{\link{vertex_connectivity}()} } \concept{flow} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Separators.html#igraph_is_minimal_separator}{\code{igraph_is_minimal_separator()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Separators.html#igraph_is_minimal_separator}{\code{is_minimal_separator()}}.} diff --git a/man/is_separator.Rd b/man/is_separator.Rd index 49ff54ed396..6906cf8fba8 100644 --- a/man/is_separator.Rd +++ b/man/is_separator.Rd @@ -48,5 +48,5 @@ Other flow: \code{\link{vertex_connectivity}()} } \concept{flow} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Separators.html#igraph_is_separator}{\code{igraph_is_separator()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Separators.html#igraph_is_separator}{\code{is_separator()}}.} diff --git a/man/is_tree.Rd b/man/is_tree.Rd index 22a52ecf6a1..cca88079f47 100644 --- a/man/is_tree.Rd +++ b/man/is_tree.Rd @@ -56,5 +56,5 @@ Other trees: } \concept{trees} \keyword{graphs} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_is_tree}{\code{igraph_is_tree()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_is_tree}{\code{is_tree()}}.} diff --git a/man/k_shortest_paths.Rd b/man/k_shortest_paths.Rd index 089d4469178..89609ee57c9 100644 --- a/man/k_shortest_paths.Rd +++ b/man/k_shortest_paths.Rd @@ -86,5 +86,5 @@ Other structural.properties: } \concept{structural.properties} \keyword{graphs} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_get_k_shortest_paths}{\code{igraph_get_k_shortest_paths()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_get_k_shortest_paths}{\code{get_k_shortest_paths()}}.} diff --git a/man/knn.Rd b/man/knn.Rd index e3d3a6ab4fa..c33aff1bb31 100644 --- a/man/knn.Rd +++ b/man/knn.Rd @@ -119,5 +119,5 @@ Gabor Csardi \email{csardi.gabor@gmail.com} } \concept{structural.properties} \keyword{graphs} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_avg_nearest_neighbor_degree}{\code{igraph_avg_nearest_neighbor_degree()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_avg_nearest_neighbor_degree}{\code{avg_nearest_neighbor_degree()}}.} diff --git a/man/laplacian_matrix.Rd b/man/laplacian_matrix.Rd index 4acb77d62b3..098e0553503 100644 --- a/man/laplacian_matrix.Rd +++ b/man/laplacian_matrix.Rd @@ -77,5 +77,5 @@ laplacian_matrix(g, normalization = "unnormalized", sparse = FALSE) Gabor Csardi \email{csardi.gabor@gmail.com} } \keyword{graphs} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_get_laplacian_sparse}{\code{igraph_get_laplacian_sparse()}}, \href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_get_laplacian}{\code{igraph_get_laplacian()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_get_laplacian_sparse}{\code{get_laplacian_sparse()}}, \href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_get_laplacian}{\code{get_laplacian()}}.} diff --git a/man/make_empty_graph.Rd b/man/make_empty_graph.Rd index d8088989678..030f1ed1b97 100644 --- a/man/make_empty_graph.Rd +++ b/man/make_empty_graph.Rd @@ -43,5 +43,5 @@ Other deterministic constructors: } \concept{Empty graph.} \concept{deterministic constructors} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Basic.html#igraph_empty}{\code{igraph_empty()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Basic.html#igraph_empty}{\code{empty()}}.} diff --git a/man/make_from_prufer.Rd b/man/make_from_prufer.Rd index fd12f3af6e1..6a1680bc05f 100644 --- a/man/make_from_prufer.Rd +++ b/man/make_from_prufer.Rd @@ -44,5 +44,5 @@ Other trees: } \concept{trees} \keyword{graphs} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Generators.html#igraph_from_prufer}{\code{igraph_from_prufer()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Generators.html#igraph_from_prufer}{\code{from_prufer()}}.} diff --git a/man/make_lattice.Rd b/man/make_lattice.Rd index 2f342953038..52e2dfe39cb 100644 --- a/man/make_lattice.Rd +++ b/man/make_lattice.Rd @@ -74,5 +74,5 @@ Other deterministic constructors: } \concept{Lattice} \concept{deterministic constructors} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Generators.html#igraph_square_lattice}{\code{igraph_square_lattice()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Generators.html#igraph_square_lattice}{\code{square_lattice()}}.} diff --git a/man/max_cardinality.Rd b/man/max_cardinality.Rd index 4f7150b300d..1dde1ac3e2d 100644 --- a/man/max_cardinality.Rd +++ b/man/max_cardinality.Rd @@ -66,5 +66,5 @@ Gabor Csardi \email{csardi.gabor@gmail.com} } \concept{chordal} \keyword{graphs} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_maximum_cardinality_search}{\code{igraph_maximum_cardinality_search()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_maximum_cardinality_search}{\code{maximum_cardinality_search()}}.} diff --git a/man/max_flow.Rd b/man/max_flow.Rd index 7b6c009a9c1..9ab924d0ef2 100644 --- a/man/max_flow.Rd +++ b/man/max_flow.Rd @@ -84,5 +84,5 @@ Other flow: \code{\link{vertex_connectivity}()} } \concept{flow} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Flows.html#igraph_maxflow}{\code{igraph_maxflow()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Flows.html#igraph_maxflow}{\code{maxflow()}}.} diff --git a/man/min_separators.Rd b/man/min_separators.Rd index f14d553a53e..98820f46df5 100644 --- a/man/min_separators.Rd +++ b/man/min_separators.Rd @@ -92,5 +92,5 @@ Other flow: \code{\link{vertex_connectivity}()} } \concept{flow} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Separators.html#igraph_minimum_size_separators}{\code{igraph_minimum_size_separators()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Separators.html#igraph_minimum_size_separators}{\code{minimum_size_separators()}}.} diff --git a/man/min_st_separators.Rd b/man/min_st_separators.Rd index be4938da3fc..6a1924654d3 100644 --- a/man/min_st_separators.Rd +++ b/man/min_st_separators.Rd @@ -84,5 +84,5 @@ Gabor Csardi \email{csardi.gabor@gmail.com} } \concept{flow} \keyword{graphs} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Separators.html#igraph_all_minimal_st_separators}{\code{igraph_all_minimal_st_separators()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Separators.html#igraph_all_minimal_st_separators}{\code{all_minimal_st_separators()}}.} diff --git a/man/page_rank.Rd b/man/page_rank.Rd index 0f14a4960f8..ca6089e2429 100644 --- a/man/page_rank.Rd +++ b/man/page_rank.Rd @@ -128,5 +128,5 @@ Tamas Nepusz \email{ntamas@gmail.com} and Gabor Csardi } \concept{centrality} \keyword{graphs} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_personalized_pagerank}{\code{igraph_personalized_pagerank()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_personalized_pagerank}{\code{personalized_pagerank()}}.} diff --git a/man/permute.Rd b/man/permute.Rd index ee3c3fda3cb..2dab221f426 100644 --- a/man/permute.Rd +++ b/man/permute.Rd @@ -78,5 +78,5 @@ Gabor Csardi \email{csardi.gabor@gmail.com} } \concept{functions for manipulating graph structure} \keyword{graphs} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Isomorphism.html#igraph_permute_vertices}{\code{igraph_permute_vertices()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Isomorphism.html#igraph_permute_vertices}{\code{permute_vertices()}}.} diff --git a/man/radius.Rd b/man/radius.Rd index c090f1fa3f1..16cb54ccbe5 100644 --- a/man/radius.Rd +++ b/man/radius.Rd @@ -61,5 +61,5 @@ Other paths: \code{\link{graph_center}()} } \concept{paths} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_radius_dijkstra}{\code{igraph_radius_dijkstra()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_radius_dijkstra}{\code{radius_dijkstra()}}.} diff --git a/man/random_walk.Rd b/man/random_walk.Rd index c08ab2f928d..22105a3c221 100644 --- a/man/random_walk.Rd +++ b/man/random_walk.Rd @@ -81,5 +81,5 @@ cor(table(w), ec) cor(table(w), pg) } \concept{random_walk} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Visitors.html#igraph_random_walk}{\code{igraph_random_walk()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Visitors.html#igraph_random_walk}{\code{random_walk()}}.} diff --git a/man/read_graph.Rd b/man/read_graph.Rd index eec410f9ff5..ddbf15b9ca5 100644 --- a/man/read_graph.Rd +++ b/man/read_graph.Rd @@ -102,5 +102,5 @@ Gabor Csardi \email{csardi.gabor@gmail.com} } \concept{foreign} \keyword{graphs} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Foreign.html#igraph_read_graph_dimacs_flow}{\code{igraph_read_graph_dimacs_flow()}}, \href{https://igraph.org/c/html/latest/igraph-Foreign.html#igraph_read_graph_dl}{\code{igraph_read_graph_dl()}}, \href{https://igraph.org/c/html/latest/igraph-Foreign.html#igraph_read_graph_edgelist}{\code{igraph_read_graph_edgelist()}}, \href{https://igraph.org/c/html/latest/igraph-Foreign.html#igraph_read_graph_gml}{\code{igraph_read_graph_gml()}}, \href{https://igraph.org/c/html/latest/igraph-Foreign.html#igraph_read_graph_graphdb}{\code{igraph_read_graph_graphdb()}}, \href{https://igraph.org/c/html/latest/igraph-Foreign.html#igraph_read_graph_graphml}{\code{igraph_read_graph_graphml()}}, \href{https://igraph.org/c/html/latest/igraph-Foreign.html#igraph_read_graph_lgl}{\code{igraph_read_graph_lgl()}}, \href{https://igraph.org/c/html/latest/igraph-Foreign.html#igraph_read_graph_ncol}{\code{igraph_read_graph_ncol()}}, \href{https://igraph.org/c/html/latest/igraph-Foreign.html#igraph_read_graph_pajek}{\code{igraph_read_graph_pajek()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Foreign.html#igraph_read_graph_dimacs_flow}{\code{read_graph_dimacs_flow()}}, \href{https://igraph.org/c/html/latest/igraph-Foreign.html#igraph_read_graph_dl}{\code{read_graph_dl()}}, \href{https://igraph.org/c/html/latest/igraph-Foreign.html#igraph_read_graph_edgelist}{\code{read_graph_edgelist()}}, \href{https://igraph.org/c/html/latest/igraph-Foreign.html#igraph_read_graph_gml}{\code{read_graph_gml()}}, \href{https://igraph.org/c/html/latest/igraph-Foreign.html#igraph_read_graph_graphdb}{\code{read_graph_graphdb()}}, \href{https://igraph.org/c/html/latest/igraph-Foreign.html#igraph_read_graph_graphml}{\code{read_graph_graphml()}}, \href{https://igraph.org/c/html/latest/igraph-Foreign.html#igraph_read_graph_lgl}{\code{read_graph_lgl()}}, \href{https://igraph.org/c/html/latest/igraph-Foreign.html#igraph_read_graph_ncol}{\code{read_graph_ncol()}}, \href{https://igraph.org/c/html/latest/igraph-Foreign.html#igraph_read_graph_pajek}{\code{read_graph_pajek()}}.} diff --git a/man/realize_bipartite_degseq.Rd b/man/realize_bipartite_degseq.Rd index 3ffc5e60ce4..873e9d12c04 100644 --- a/man/realize_bipartite_degseq.Rd +++ b/man/realize_bipartite_degseq.Rd @@ -60,5 +60,5 @@ degree(g) \code{\link[=realize_degseq]{realize_degseq()}} to create a not necessarily bipartite graph. } \keyword{graphs} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Generators.html#igraph_realize_bipartite_degree_sequence}{\code{igraph_realize_bipartite_degree_sequence()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Generators.html#igraph_realize_bipartite_degree_sequence}{\code{realize_bipartite_degree_sequence()}}.} diff --git a/man/realize_degseq.Rd b/man/realize_degseq.Rd index 7ddbaca212a..8b2e2fcad2b 100644 --- a/man/realize_degseq.Rd +++ b/man/realize_degseq.Rd @@ -111,5 +111,5 @@ Connectedness matters: construction and exact random sampling of connected netwo from graphs with the given degree sequence. } \keyword{graphs} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Generators.html#igraph_realize_degree_sequence}{\code{igraph_realize_degree_sequence()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Generators.html#igraph_realize_degree_sequence}{\code{realize_degree_sequence()}}.} diff --git a/man/reciprocity.Rd b/man/reciprocity.Rd index 4563ab737c3..b43cf3f63ec 100644 --- a/man/reciprocity.Rd +++ b/man/reciprocity.Rd @@ -73,5 +73,5 @@ Tamas Nepusz \email{ntamas@gmail.com} and Gabor Csardi } \concept{structural.properties} \keyword{graphs} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_reciprocity}{\code{igraph_reciprocity()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_reciprocity}{\code{reciprocity()}}.} diff --git a/man/reverse_edges.Rd b/man/reverse_edges.Rd index eafbb436256..c4afc1e66c6 100644 --- a/man/reverse_edges.Rd +++ b/man/reverse_edges.Rd @@ -58,5 +58,5 @@ Other functions for manipulating graph structure: \code{\link{vertex}()} } \concept{functions for manipulating graph structure} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Operators.html#igraph_reverse_edges}{\code{igraph_reverse_edges()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Operators.html#igraph_reverse_edges}{\code{reverse_edges()}}.} diff --git a/man/sample_bipartite.Rd b/man/sample_bipartite.Rd index c1ecb188a30..b0b68f3cc37 100644 --- a/man/sample_bipartite.Rd +++ b/man/sample_bipartite.Rd @@ -15,7 +15,7 @@ sample_bipartite( mode = c("out", "in", "all") ) -bipartite(...) +bipartite(..., type = NULL) } \arguments{ \item{n1}{Integer scalar, the number of bottom vertices.} diff --git a/man/sample_chung_lu.Rd b/man/sample_chung_lu.Rd index e5040eda4d7..52de7869b7c 100644 --- a/man/sample_chung_lu.Rd +++ b/man/sample_chung_lu.Rd @@ -196,5 +196,5 @@ Random graph models (games) \code{\link{sample_tree}()} } \concept{games} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Generators.html#igraph_chung_lu_game}{\code{igraph_chung_lu_game()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Generators.html#igraph_chung_lu_game}{\code{chung_lu_game()}}.} diff --git a/man/sample_correlated_gnp.Rd b/man/sample_correlated_gnp.Rd index 563730a3498..215c5f1c4c3 100644 --- a/man/sample_correlated_gnp.Rd +++ b/man/sample_correlated_gnp.Rd @@ -84,5 +84,5 @@ Random graph models (games) \code{\link{sample_tree}()} } \concept{games} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Generators.html#igraph_correlated_game}{\code{igraph_correlated_game()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Generators.html#igraph_correlated_game}{\code{correlated_game()}}.} diff --git a/man/sample_correlated_gnp_pair.Rd b/man/sample_correlated_gnp_pair.Rd index f6ba5cfd959..8244f3a5bcc 100644 --- a/man/sample_correlated_gnp_pair.Rd +++ b/man/sample_correlated_gnp_pair.Rd @@ -78,5 +78,5 @@ Random graph models (games) } \concept{games} \keyword{graphs} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Generators.html#igraph_correlated_pair_game}{\code{igraph_correlated_pair_game()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Generators.html#igraph_correlated_pair_game}{\code{correlated_pair_game()}}.} diff --git a/man/sample_dot_product.Rd b/man/sample_dot_product.Rd index f658f4e08bd..44e6f018a5a 100644 --- a/man/sample_dot_product.Rd +++ b/man/sample_dot_product.Rd @@ -89,5 +89,5 @@ Gabor Csardi \email{csardi.gabor@gmail.com} } \concept{games} \keyword{graphs} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Generators.html#igraph_dot_product_game}{\code{igraph_dot_product_game()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Generators.html#igraph_dot_product_game}{\code{dot_product_game()}}.} diff --git a/man/sample_fitness.Rd b/man/sample_fitness.Rd index 6b8c34bf655..1502423df95 100644 --- a/man/sample_fitness.Rd +++ b/man/sample_fitness.Rd @@ -111,5 +111,5 @@ Tamas Nepusz \email{ntamas@gmail.com} } \concept{games} \keyword{graphs} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Generators.html#igraph_static_fitness_game}{\code{igraph_static_fitness_game()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Generators.html#igraph_static_fitness_game}{\code{static_fitness_game()}}.} diff --git a/man/sample_fitness_pl.Rd b/man/sample_fitness_pl.Rd index 18e547e3f7e..166c910685a 100644 --- a/man/sample_fitness_pl.Rd +++ b/man/sample_fitness_pl.Rd @@ -120,5 +120,5 @@ Tamas Nepusz \email{ntamas@gmail.com} } \concept{games} \keyword{graphs} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Generators.html#igraph_static_power_law_game}{\code{igraph_static_power_law_game()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Generators.html#igraph_static_power_law_game}{\code{static_power_law_game()}}.} diff --git a/man/sample_forestfire.Rd b/man/sample_forestfire.Rd index 1d6c6f9765a..432851c53d6 100644 --- a/man/sample_forestfire.Rd +++ b/man/sample_forestfire.Rd @@ -109,5 +109,5 @@ Gabor Csardi \email{csardi.gabor@gmail.com} } \concept{games} \keyword{graphs} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Generators.html#igraph_forest_fire_game}{\code{igraph_forest_fire_game()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Generators.html#igraph_forest_fire_game}{\code{forest_fire_game()}}.} diff --git a/man/sample_growing.Rd b/man/sample_growing.Rd index ab7826d489b..6423905fb78 100644 --- a/man/sample_growing.Rd +++ b/man/sample_growing.Rd @@ -74,5 +74,5 @@ Gabor Csardi \email{csardi.gabor@gmail.com} } \concept{games} \keyword{graphs} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Generators.html#igraph_growing_random_game}{\code{igraph_growing_random_game()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Generators.html#igraph_growing_random_game}{\code{growing_random_game()}}.} diff --git a/man/sample_hierarchical_sbm.Rd b/man/sample_hierarchical_sbm.Rd index 48c0ab53d1e..7d538ca5c17 100644 --- a/man/sample_hierarchical_sbm.Rd +++ b/man/sample_hierarchical_sbm.Rd @@ -89,5 +89,5 @@ Gabor Csardi \email{csardi.gabor@gmail.com} } \concept{games} \keyword{graphs} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Generators.html#igraph_hsbm_game}{\code{igraph_hsbm_game()}}, \href{https://igraph.org/c/html/latest/igraph-Generators.html#igraph_hsbm_list_game}{\code{igraph_hsbm_list_game()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Generators.html#igraph_hsbm_game}{\code{hsbm_game()}}, \href{https://igraph.org/c/html/latest/igraph-Generators.html#igraph_hsbm_list_game}{\code{hsbm_list_game()}}.} diff --git a/man/sample_hrg.Rd b/man/sample_hrg.Rd index f9ab8832599..410101be394 100644 --- a/man/sample_hrg.Rd +++ b/man/sample_hrg.Rd @@ -28,5 +28,5 @@ Other hierarchical random graph functions: \code{\link{print.igraphHRGConsensus}()} } \concept{hierarchical random graph functions} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-HRG.html#igraph_hrg_game}{\code{igraph_hrg_game()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-HRG.html#igraph_hrg_game}{\code{hrg_game()}}.} diff --git a/man/sample_islands.Rd b/man/sample_islands.Rd index be031b3f023..20c0536f2fe 100644 --- a/man/sample_islands.Rd +++ b/man/sample_islands.Rd @@ -68,5 +68,5 @@ Samuel Thiriot } \concept{games} \keyword{graphs} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Generators.html#igraph_simple_interconnected_islands_game}{\code{igraph_simple_interconnected_islands_game()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Generators.html#igraph_simple_interconnected_islands_game}{\code{simple_interconnected_islands_game()}}.} diff --git a/man/sample_k_regular.Rd b/man/sample_k_regular.Rd index 82583292740..102511c17da 100644 --- a/man/sample_k_regular.Rd +++ b/man/sample_k_regular.Rd @@ -80,5 +80,5 @@ Tamas Nepusz \email{ntamas@gmail.com} } \concept{games} \keyword{graphs} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Generators.html#igraph_k_regular_game}{\code{igraph_k_regular_game()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Generators.html#igraph_k_regular_game}{\code{k_regular_game()}}.} diff --git a/man/sample_sbm.Rd b/man/sample_sbm.Rd index c771995ca82..e11e2c4315a 100644 --- a/man/sample_sbm.Rd +++ b/man/sample_sbm.Rd @@ -85,5 +85,5 @@ Gabor Csardi \email{csardi.gabor@gmail.com} } \concept{games} \keyword{graphs} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Generators.html#igraph_sbm_game}{\code{igraph_sbm_game()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Generators.html#igraph_sbm_game}{\code{sbm_game()}}.} diff --git a/man/sample_spanning_tree.Rd b/man/sample_spanning_tree.Rd index 2d0545b3178..69efb56e52b 100644 --- a/man/sample_spanning_tree.Rd +++ b/man/sample_spanning_tree.Rd @@ -43,5 +43,5 @@ Other trees: } \concept{trees} \keyword{graph} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_random_spanning_tree}{\code{igraph_random_spanning_tree()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_random_spanning_tree}{\code{random_spanning_tree()}}.} diff --git a/man/sample_tree.Rd b/man/sample_tree.Rd index a5c600ba8f5..f2e025926a5 100644 --- a/man/sample_tree.Rd +++ b/man/sample_tree.Rd @@ -66,5 +66,5 @@ Random graph models (games) } \concept{games} \keyword{graphs} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Generators.html#igraph_tree_game}{\code{igraph_tree_game()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Generators.html#igraph_tree_game}{\code{tree_game()}}.} diff --git a/man/similarity.Rd b/man/similarity.Rd index 8a721c823d5..5f124a707bc 100644 --- a/man/similarity.Rd +++ b/man/similarity.Rd @@ -78,5 +78,5 @@ Tamas Nepusz \email{ntamas@gmail.com} and Gabor Csardi \concept{cocitation} \concept{similarity} \keyword{graphs} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_similarity_jaccard}{\code{igraph_similarity_jaccard()}}, \href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_similarity_dice}{\code{igraph_similarity_dice()}}, \href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_similarity_inverse_log_weighted}{\code{igraph_similarity_inverse_log_weighted()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_similarity_jaccard}{\code{similarity_jaccard()}}, \href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_similarity_dice}{\code{similarity_dice()}}, \href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_similarity_inverse_log_weighted}{\code{similarity_inverse_log_weighted()}}.} diff --git a/man/simplify.Rd b/man/simplify.Rd index 564889e89de..9ebaa39c3ca 100644 --- a/man/simplify.Rd +++ b/man/simplify.Rd @@ -103,5 +103,5 @@ Gabor Csardi \email{csardi.gabor@gmail.com} \concept{isomorphism} \concept{simple} \keyword{graphs} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Operators.html#igraph_simplify}{\code{igraph_simplify()}}, \href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_is_simple}{\code{igraph_is_simple()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Operators.html#igraph_simplify}{\code{simplify()}}, \href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_is_simple}{\code{is_simple()}}.} diff --git a/man/sir.Rd b/man/sir.Rd index 4a18a428ff8..6bfe884bcda 100644 --- a/man/sir.Rd +++ b/man/sir.Rd @@ -119,5 +119,5 @@ Gabor Csardi \email{csardi.gabor@gmail.com}. Eric Kolaczyk } \concept{processes} \keyword{graphs} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Spatial-Games.html#igraph_sir}{\code{igraph_sir()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Spatial-Games.html#igraph_sir}{\code{sir()}}.} diff --git a/man/st_cuts.Rd b/man/st_cuts.Rd index d734c2bc2f9..970295a3a56 100644 --- a/man/st_cuts.Rd +++ b/man/st_cuts.Rd @@ -66,5 +66,5 @@ Gabor Csardi \email{csardi.gabor@gmail.com} } \concept{flow} \keyword{graphs} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Flows.html#igraph_all_st_cuts}{\code{igraph_all_st_cuts()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Flows.html#igraph_all_st_cuts}{\code{all_st_cuts()}}.} diff --git a/man/st_min_cuts.Rd b/man/st_min_cuts.Rd index e63aace2b51..8a58a974cd3 100644 --- a/man/st_min_cuts.Rd +++ b/man/st_min_cuts.Rd @@ -76,5 +76,5 @@ Gabor Csardi \email{csardi.gabor@gmail.com} } \concept{flow} \keyword{graphs} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Flows.html#igraph_all_st_mincuts}{\code{igraph_all_st_mincuts()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Flows.html#igraph_all_st_mincuts}{\code{all_st_mincuts()}}.} diff --git a/man/strength.Rd b/man/strength.Rd index 20956112c6d..76a2e34f9b6 100644 --- a/man/strength.Rd +++ b/man/strength.Rd @@ -74,5 +74,5 @@ Gabor Csardi \email{csardi.gabor@gmail.com} } \concept{centrality} \keyword{graphs} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_strength}{\code{igraph_strength()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_strength}{\code{strength()}}.} diff --git a/man/to_prufer.Rd b/man/to_prufer.Rd index 9ddaa6b9206..38d7ceee139 100644 --- a/man/to_prufer.Rd +++ b/man/to_prufer.Rd @@ -41,5 +41,5 @@ Other trees: } \concept{trees} \keyword{graphs} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_to_prufer}{\code{igraph_to_prufer()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_to_prufer}{\code{to_prufer()}}.} diff --git a/man/triad_census.Rd b/man/triad_census.Rd index 9014898a624..58d7c144d45 100644 --- a/man/triad_census.Rd +++ b/man/triad_census.Rd @@ -54,5 +54,5 @@ Gabor Csardi \email{csardi.gabor@gmail.com} } \concept{motifs} \keyword{graphs} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Motifs.html#igraph_triad_census}{\code{igraph_triad_census()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Motifs.html#igraph_triad_census}{\code{triad_census()}}.} diff --git a/man/voronoi_cells.Rd b/man/voronoi_cells.Rd index 8decb61541f..76d4c084d65 100644 --- a/man/voronoi_cells.Rd +++ b/man/voronoi_cells.Rd @@ -85,5 +85,5 @@ Community detection \code{\link{split_join_distance}()} } \concept{community} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_voronoi}{\code{igraph_voronoi()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_voronoi}{\code{voronoi()}}.} diff --git a/man/weighted_cliques.Rd b/man/weighted_cliques.Rd index 0718dd33aab..87620a75a82 100644 --- a/man/weighted_cliques.Rd +++ b/man/weighted_cliques.Rd @@ -75,5 +75,5 @@ Tamas Nepusz \email{ntamas@gmail.com} and Gabor Csardi } \concept{cliques} \keyword{graphs} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Cliques.html#igraph_weighted_cliques}{\code{igraph_weighted_cliques()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Cliques.html#igraph_weighted_cliques}{\code{weighted_cliques()}}.} diff --git a/man/which_multiple.Rd b/man/which_multiple.Rd index 8dcfbc305ce..7fd5731e4f0 100644 --- a/man/which_multiple.Rd +++ b/man/which_multiple.Rd @@ -115,5 +115,5 @@ Gabor Csardi \email{csardi.gabor@gmail.com} } \concept{structural.properties} \keyword{graphs} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_is_multiple}{\code{igraph_is_multiple()}}, \href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_has_multiple}{\code{igraph_has_multiple()}}, \href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_count_multiple}{\code{igraph_count_multiple()}}, \href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_is_loop}{\code{igraph_is_loop()}}, \href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_has_loop}{\code{igraph_has_loop()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_is_multiple}{\code{is_multiple()}}, \href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_has_multiple}{\code{has_multiple()}}, \href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_count_multiple}{\code{count_multiple()}}, \href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_is_loop}{\code{is_loop()}}, \href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_has_loop}{\code{has_loop()}}.} diff --git a/man/which_mutual.Rd b/man/which_mutual.Rd index f047cc424cd..99bb3d18a21 100644 --- a/man/which_mutual.Rd +++ b/man/which_mutual.Rd @@ -72,5 +72,5 @@ Gabor Csardi \email{csardi.gabor@gmail.com} } \concept{structural.properties} \keyword{graphs} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_is_mutual}{\code{igraph_is_mutual()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_is_mutual}{\code{is_mutual()}}.} diff --git a/man/write_graph.Rd b/man/write_graph.Rd index e3e2571bc86..388e15b72bf 100644 --- a/man/write_graph.Rd +++ b/man/write_graph.Rd @@ -85,5 +85,5 @@ Gabor Csardi \email{csardi.gabor@gmail.com} } \concept{foreign} \keyword{graphs} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Foreign.html#igraph_write_graph_dimacs_flow}{\code{igraph_write_graph_dimacs_flow()}}, \href{https://igraph.org/c/html/latest/igraph-Foreign.html#igraph_write_graph_dot}{\code{igraph_write_graph_dot()}}, \href{https://igraph.org/c/html/latest/igraph-Foreign.html#igraph_write_graph_edgelist}{\code{igraph_write_graph_edgelist()}}, \href{https://igraph.org/c/html/latest/igraph-Foreign.html#igraph_write_graph_gml}{\code{igraph_write_graph_gml()}}, \href{https://igraph.org/c/html/latest/igraph-Foreign.html#igraph_write_graph_graphml}{\code{igraph_write_graph_graphml()}}, \href{https://igraph.org/c/html/latest/igraph-Foreign.html#igraph_write_graph_leda}{\code{igraph_write_graph_leda()}}, \href{https://igraph.org/c/html/latest/igraph-Foreign.html#igraph_write_graph_lgl}{\code{igraph_write_graph_lgl()}}, \href{https://igraph.org/c/html/latest/igraph-Foreign.html#igraph_write_graph_ncol}{\code{igraph_write_graph_ncol()}}, \href{https://igraph.org/c/html/latest/igraph-Foreign.html#igraph_write_graph_pajek}{\code{igraph_write_graph_pajek()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Foreign.html#igraph_write_graph_dimacs_flow}{\code{write_graph_dimacs_flow()}}, \href{https://igraph.org/c/html/latest/igraph-Foreign.html#igraph_write_graph_dot}{\code{write_graph_dot()}}, \href{https://igraph.org/c/html/latest/igraph-Foreign.html#igraph_write_graph_edgelist}{\code{write_graph_edgelist()}}, \href{https://igraph.org/c/html/latest/igraph-Foreign.html#igraph_write_graph_gml}{\code{write_graph_gml()}}, \href{https://igraph.org/c/html/latest/igraph-Foreign.html#igraph_write_graph_graphml}{\code{write_graph_graphml()}}, \href{https://igraph.org/c/html/latest/igraph-Foreign.html#igraph_write_graph_leda}{\code{write_graph_leda()}}, \href{https://igraph.org/c/html/latest/igraph-Foreign.html#igraph_write_graph_lgl}{\code{write_graph_lgl()}}, \href{https://igraph.org/c/html/latest/igraph-Foreign.html#igraph_write_graph_ncol}{\code{write_graph_ncol()}}, \href{https://igraph.org/c/html/latest/igraph-Foreign.html#igraph_write_graph_pajek}{\code{write_graph_pajek()}}.} From a1c7800e8ab33abca992d845df3b40c549d84002 Mon Sep 17 00:00:00 2001 From: krlmlr Date: Thu, 20 Mar 2025 10:18:08 +0000 Subject: [PATCH 5/8] chore: Auto-update from GitHub Actions Run: https://github.com/igraph/rigraph/actions/runs/13966740145 --- man/are_adjacent.Rd | 2 +- man/articulation_points.Rd | 2 +- man/as_directed.Rd | 2 +- man/assortativity.Rd | 2 +- man/automorphism_group.Rd | 2 +- man/biconnected_components.Rd | 2 +- man/bipartite_mapping.Rd | 2 +- man/bipartite_projection.Rd | 2 +- man/canonical_permutation.Rd | 2 +- man/centr_betw_tmax.Rd | 2 +- man/centr_clo.Rd | 2 +- man/centr_clo_tmax.Rd | 2 +- man/centr_degree.Rd | 2 +- man/centr_eigen.Rd | 2 +- man/centr_eigen_tmax.Rd | 2 +- man/centralize.Rd | 2 +- man/cliques.Rd | 2 +- man/components.Rd | 2 +- man/consensus_tree.Rd | 2 +- man/contract.Rd | 2 +- man/convex_hull.Rd | 2 +- man/count_automorphisms.Rd | 2 +- man/count_triangles.Rd | 2 +- man/degree.Rd | 2 +- man/dim_select.Rd | 2 +- man/distances.Rd | 2 +- man/diversity.Rd | 2 +- man/dyad_census.Rd | 2 +- man/eccentricity.Rd | 2 +- man/edge_density.Rd | 2 +- man/eigen_centrality.Rd | 2 +- man/embed_adjacency_matrix.Rd | 2 +- man/embed_laplacian_matrix.Rd | 2 +- man/feedback_arc_set.Rd | 2 +- man/feedback_vertex_set.Rd | 2 +- man/global_efficiency.Rd | 2 +- man/gorder.Rd | 2 +- man/graph.lattice.Rd | 2 +- man/graph_center.Rd | 2 +- man/graph_from_adj_list.Rd | 2 +- man/graph_from_isomorphism_class.Rd | 2 +- man/graph_from_lcf.Rd | 2 +- man/graphlet_basis.Rd | 2 +- man/greedy_vertex_coloring.Rd | 2 +- man/harmonic_centrality.Rd | 2 +- man/has_eulerian_path.Rd | 2 +- man/hits_scores.Rd | 2 +- man/hrg.Rd | 2 +- man/hrg_tree.Rd | 2 +- man/is_acyclic.Rd | 2 +- man/is_biconnected.Rd | 2 +- man/is_dag.Rd | 2 +- man/is_forest.Rd | 2 +- man/is_graphical.Rd | 2 +- man/is_min_separator.Rd | 2 +- man/is_separator.Rd | 2 +- man/is_tree.Rd | 2 +- man/k_shortest_paths.Rd | 2 +- man/knn.Rd | 2 +- man/laplacian_matrix.Rd | 2 +- man/make_empty_graph.Rd | 2 +- man/make_from_prufer.Rd | 2 +- man/make_lattice.Rd | 2 +- man/max_cardinality.Rd | 2 +- man/max_flow.Rd | 2 +- man/min_separators.Rd | 2 +- man/min_st_separators.Rd | 2 +- man/page_rank.Rd | 2 +- man/permute.Rd | 2 +- man/radius.Rd | 2 +- man/random_walk.Rd | 2 +- man/read_graph.Rd | 2 +- man/realize_bipartite_degseq.Rd | 2 +- man/realize_degseq.Rd | 2 +- man/reciprocity.Rd | 2 +- man/reverse_edges.Rd | 2 +- man/sample_chung_lu.Rd | 2 +- man/sample_correlated_gnp.Rd | 2 +- man/sample_correlated_gnp_pair.Rd | 2 +- man/sample_dot_product.Rd | 2 +- man/sample_fitness.Rd | 2 +- man/sample_fitness_pl.Rd | 2 +- man/sample_forestfire.Rd | 2 +- man/sample_growing.Rd | 2 +- man/sample_hierarchical_sbm.Rd | 2 +- man/sample_hrg.Rd | 2 +- man/sample_islands.Rd | 2 +- man/sample_k_regular.Rd | 2 +- man/sample_sbm.Rd | 2 +- man/sample_spanning_tree.Rd | 2 +- man/sample_tree.Rd | 2 +- man/similarity.Rd | 2 +- man/simplify.Rd | 2 +- man/sir.Rd | 2 +- man/st_cuts.Rd | 2 +- man/st_min_cuts.Rd | 2 +- man/strength.Rd | 2 +- man/to_prufer.Rd | 2 +- man/triad_census.Rd | 2 +- man/voronoi_cells.Rd | 2 +- man/weighted_cliques.Rd | 2 +- man/which_multiple.Rd | 2 +- man/which_mutual.Rd | 2 +- man/write_graph.Rd | 2 +- 104 files changed, 104 insertions(+), 104 deletions(-) diff --git a/man/are_adjacent.Rd b/man/are_adjacent.Rd index 56843838e5b..8a57057f4e6 100644 --- a/man/are_adjacent.Rd +++ b/man/are_adjacent.Rd @@ -48,5 +48,5 @@ Other structural queries: \code{\link{tail_of}()} } \concept{structural queries} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_are_adjacent}{\code{igraph_are_adjacent()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_are_adjacent}{\code{are_adjacent()}}.} diff --git a/man/articulation_points.Rd b/man/articulation_points.Rd index 124b1d6bd03..91016495ccb 100644 --- a/man/articulation_points.Rd +++ b/man/articulation_points.Rd @@ -57,5 +57,5 @@ Gabor Csardi \email{csardi.gabor@gmail.com} } \concept{components} \keyword{graphs} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_articulation_points}{\code{igraph_articulation_points()}}, \href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_bridges}{\code{igraph_bridges()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_articulation_points}{\code{articulation_points()}}, \href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_bridges}{\code{bridges()}}.} diff --git a/man/as_directed.Rd b/man/as_directed.Rd index e8a1ee31ba5..729363ba44b 100644 --- a/man/as_directed.Rd +++ b/man/as_directed.Rd @@ -118,5 +118,5 @@ Gabor Csardi \email{csardi.gabor@gmail.com} } \concept{conversion} \keyword{graphs} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_to_directed}{\code{igraph_to_directed()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_to_directed}{\code{to_directed()}}.} diff --git a/man/assortativity.Rd b/man/assortativity.Rd index 303326ef579..038771a866a 100644 --- a/man/assortativity.Rd +++ b/man/assortativity.Rd @@ -126,5 +126,5 @@ M. E. J. Newman: Assortative mixing in networks, \emph{Phys. Rev. Lett.} 89, Gabor Csardi \email{csardi.gabor@gmail.com} } \keyword{graphs} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_assortativity}{\code{igraph_assortativity()}}, \href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_assortativity_nominal}{\code{igraph_assortativity_nominal()}}, \href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_assortativity_degree}{\code{igraph_assortativity_degree()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_assortativity}{\code{assortativity()}}, \href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_assortativity_nominal}{\code{assortativity_nominal()}}, \href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_assortativity_degree}{\code{assortativity_degree()}}.} diff --git a/man/automorphism_group.Rd b/man/automorphism_group.Rd index 7ac6ea08ddf..b6c9c94f2de 100644 --- a/man/automorphism_group.Rd +++ b/man/automorphism_group.Rd @@ -83,5 +83,5 @@ Tamas Nepusz \email{ntamas@gmail.com} for this manual page. } \concept{graph automorphism} \keyword{graphs} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Isomorphism.html#igraph_automorphism_group}{\code{igraph_automorphism_group()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Isomorphism.html#igraph_automorphism_group}{\code{automorphism_group()}}.} diff --git a/man/biconnected_components.Rd b/man/biconnected_components.Rd index b69f2fbe7b1..6abf99f79d5 100644 --- a/man/biconnected_components.Rd +++ b/man/biconnected_components.Rd @@ -56,5 +56,5 @@ Gabor Csardi \email{csardi.gabor@gmail.com} } \concept{components} \keyword{graphs} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_biconnected_components}{\code{igraph_biconnected_components()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_biconnected_components}{\code{biconnected_components()}}.} diff --git a/man/bipartite_mapping.Rd b/man/bipartite_mapping.Rd index c6974de72fe..785a0304841 100644 --- a/man/bipartite_mapping.Rd +++ b/man/bipartite_mapping.Rd @@ -61,5 +61,5 @@ Gabor Csardi \email{csardi.gabor@gmail.com} } \concept{bipartite} \keyword{graphs} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Bipartite.html#igraph_is_bipartite}{\code{igraph_is_bipartite()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Bipartite.html#igraph_is_bipartite}{\code{is_bipartite()}}.} diff --git a/man/bipartite_projection.Rd b/man/bipartite_projection.Rd index 6c15c2270c6..7dbc2a65cc8 100644 --- a/man/bipartite_projection.Rd +++ b/man/bipartite_projection.Rd @@ -100,5 +100,5 @@ Gabor Csardi \email{csardi.gabor@gmail.com} } \concept{bipartite} \keyword{graphs} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Bipartite.html#igraph_bipartite_projection_size}{\code{igraph_bipartite_projection_size()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Bipartite.html#igraph_bipartite_projection_size}{\code{bipartite_projection_size()}}.} diff --git a/man/canonical_permutation.Rd b/man/canonical_permutation.Rd index 9da7fe458c3..70840add231 100644 --- a/man/canonical_permutation.Rd +++ b/man/canonical_permutation.Rd @@ -105,5 +105,5 @@ Tommi Junttila for BLISS, Gabor Csardi } \concept{graph isomorphism} \keyword{graphs} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Isomorphism.html#igraph_canonical_permutation}{\code{igraph_canonical_permutation()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Isomorphism.html#igraph_canonical_permutation}{\code{canonical_permutation()}}.} diff --git a/man/centr_betw_tmax.Rd b/man/centr_betw_tmax.Rd index 9ec4170e22b..8341178531d 100644 --- a/man/centr_betw_tmax.Rd +++ b/man/centr_betw_tmax.Rd @@ -44,5 +44,5 @@ Other centralization related: \code{\link{centralize}()} } \concept{centralization related} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_centralization_betweenness_tmax}{\code{igraph_centralization_betweenness_tmax()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_centralization_betweenness_tmax}{\code{centralization_betweenness_tmax()}}.} diff --git a/man/centr_clo.Rd b/man/centr_clo.Rd index 085dc9e662a..378ea6d3242 100644 --- a/man/centr_clo.Rd +++ b/man/centr_clo.Rd @@ -47,5 +47,5 @@ Other centralization related: \code{\link{centralize}()} } \concept{centralization related} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_centralization_closeness}{\code{igraph_centralization_closeness()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_centralization_closeness}{\code{centralization_closeness()}}.} diff --git a/man/centr_clo_tmax.Rd b/man/centr_clo_tmax.Rd index 1f047ff9cf7..91abfd3e694 100644 --- a/man/centr_clo_tmax.Rd +++ b/man/centr_clo_tmax.Rd @@ -43,5 +43,5 @@ Other centralization related: \code{\link{centralize}()} } \concept{centralization related} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_centralization_closeness_tmax}{\code{igraph_centralization_closeness_tmax()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_centralization_closeness_tmax}{\code{centralization_closeness_tmax()}}.} diff --git a/man/centr_degree.Rd b/man/centr_degree.Rd index e7189a6b988..1ed1d52ac88 100644 --- a/man/centr_degree.Rd +++ b/man/centr_degree.Rd @@ -55,5 +55,5 @@ Other centralization related: \code{\link{centralize}()} } \concept{centralization related} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_centralization_degree}{\code{igraph_centralization_degree()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_centralization_degree}{\code{centralization_degree()}}.} diff --git a/man/centr_eigen.Rd b/man/centr_eigen.Rd index 64fd75e185e..955c3b43723 100644 --- a/man/centr_eigen.Rd +++ b/man/centr_eigen.Rd @@ -66,5 +66,5 @@ Other centralization related: \code{\link{centralize}()} } \concept{centralization related} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_centralization_eigenvector_centrality}{\code{igraph_centralization_eigenvector_centrality()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_centralization_eigenvector_centrality}{\code{centralization_eigenvector_centrality()}}.} diff --git a/man/centr_eigen_tmax.Rd b/man/centr_eigen_tmax.Rd index 06fd7b22250..143d51252df 100644 --- a/man/centr_eigen_tmax.Rd +++ b/man/centr_eigen_tmax.Rd @@ -51,5 +51,5 @@ Other centralization related: \code{\link{centralize}()} } \concept{centralization related} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_centralization_eigenvector_centrality_tmax}{\code{igraph_centralization_eigenvector_centrality_tmax()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_centralization_eigenvector_centrality_tmax}{\code{centralization_eigenvector_centrality_tmax()}}.} diff --git a/man/centralize.Rd b/man/centralize.Rd index 10060780217..134db123a5b 100644 --- a/man/centralize.Rd +++ b/man/centralize.Rd @@ -84,5 +84,5 @@ Other centralization related: \code{\link{centr_eigen_tmax}()} } \concept{centralization related} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_centralization}{\code{igraph_centralization()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_centralization}{\code{centralization()}}.} diff --git a/man/cliques.Rd b/man/cliques.Rd index 4f422b38d80..278ca805830 100644 --- a/man/cliques.Rd +++ b/man/cliques.Rd @@ -125,5 +125,5 @@ Tamas Nepusz \email{ntamas@gmail.com} and Gabor Csardi } \concept{cliques} \keyword{graphs} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Cliques.html#igraph_cliques}{\code{igraph_cliques()}}, \href{https://igraph.org/c/html/latest/igraph-Cliques.html#igraph_largest_cliques}{\code{igraph_largest_cliques()}}, \href{https://igraph.org/c/html/latest/igraph-Cliques.html#igraph_clique_number}{\code{igraph_clique_number()}}, \href{https://igraph.org/c/html/latest/igraph-Cliques.html#igraph_largest_weighted_cliques}{\code{igraph_largest_weighted_cliques()}}, \href{https://igraph.org/c/html/latest/igraph-Cliques.html#igraph_weighted_clique_number}{\code{igraph_weighted_clique_number()}}, \href{https://igraph.org/c/html/latest/igraph-Cliques.html#igraph_maximal_cliques_hist}{\code{igraph_maximal_cliques_hist()}}, \href{https://igraph.org/c/html/latest/igraph-Cliques.html#igraph_clique_size_hist}{\code{igraph_clique_size_hist()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Cliques.html#igraph_cliques}{\code{cliques()}}, \href{https://igraph.org/c/html/latest/igraph-Cliques.html#igraph_largest_cliques}{\code{largest_cliques()}}, \href{https://igraph.org/c/html/latest/igraph-Cliques.html#igraph_clique_number}{\code{clique_number()}}, \href{https://igraph.org/c/html/latest/igraph-Cliques.html#igraph_largest_weighted_cliques}{\code{largest_weighted_cliques()}}, \href{https://igraph.org/c/html/latest/igraph-Cliques.html#igraph_weighted_clique_number}{\code{weighted_clique_number()}}, \href{https://igraph.org/c/html/latest/igraph-Cliques.html#igraph_maximal_cliques_hist}{\code{maximal_cliques_hist()}}, \href{https://igraph.org/c/html/latest/igraph-Cliques.html#igraph_clique_size_hist}{\code{clique_size_hist()}}.} diff --git a/man/components.Rd b/man/components.Rd index d8eb171683a..5e1d075fcd5 100644 --- a/man/components.Rd +++ b/man/components.Rd @@ -124,5 +124,5 @@ Gabor Csardi \email{csardi.gabor@gmail.com} \concept{components} \concept{structural.properties} \keyword{graphs} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_is_connected}{\code{igraph_is_connected()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_is_connected}{\code{is_connected()}}.} diff --git a/man/consensus_tree.Rd b/man/consensus_tree.Rd index be44cf91604..fc0442cae19 100644 --- a/man/consensus_tree.Rd +++ b/man/consensus_tree.Rd @@ -52,5 +52,5 @@ Other hierarchical random graph functions: \code{\link{sample_hrg}()} } \concept{hierarchical random graph functions} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-HRG.html#igraph_hrg_consensus}{\code{igraph_hrg_consensus()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-HRG.html#igraph_hrg_consensus}{\code{hrg_consensus()}}.} diff --git a/man/contract.Rd b/man/contract.Rd index 9b4ca036d96..e76972702aa 100644 --- a/man/contract.Rd +++ b/man/contract.Rd @@ -75,5 +75,5 @@ Gabor Csardi \email{csardi.gabor@gmail.com} } \concept{functions for manipulating graph structure} \keyword{graphs} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Operators.html#igraph_contract_vertices}{\code{igraph_contract_vertices()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Operators.html#igraph_contract_vertices}{\code{contract_vertices()}}.} diff --git a/man/convex_hull.Rd b/man/convex_hull.Rd index bf7d0e29ffc..4c244221cb5 100644 --- a/man/convex_hull.Rd +++ b/man/convex_hull.Rd @@ -39,5 +39,5 @@ Tamas Nepusz \email{ntamas@gmail.com} } \concept{other} \keyword{graphs} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Nongraph.html#igraph_convex_hull}{\code{igraph_convex_hull()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Nongraph.html#igraph_convex_hull}{\code{convex_hull()}}.} diff --git a/man/count_automorphisms.Rd b/man/count_automorphisms.Rd index 89b5ce7fa9b..4726b01170a 100644 --- a/man/count_automorphisms.Rd +++ b/man/count_automorphisms.Rd @@ -84,5 +84,5 @@ and this manual page. } \concept{graph automorphism} \keyword{graphs} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Isomorphism.html#igraph_count_automorphisms}{\code{igraph_count_automorphisms()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Isomorphism.html#igraph_count_automorphisms}{\code{count_automorphisms()}}.} diff --git a/man/count_triangles.Rd b/man/count_triangles.Rd index bb84c388c5a..8db87f9e930 100644 --- a/man/count_triangles.Rd +++ b/man/count_triangles.Rd @@ -63,5 +63,5 @@ Gabor Csardi \email{csardi.gabor@gmail.com} } \concept{triangles} \keyword{graphs} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Motifs.html#igraph_list_triangles}{\code{igraph_list_triangles()}}, \href{https://igraph.org/c/html/latest/igraph-Motifs.html#igraph_adjacent_triangles}{\code{igraph_adjacent_triangles()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Motifs.html#igraph_list_triangles}{\code{list_triangles()}}, \href{https://igraph.org/c/html/latest/igraph-Motifs.html#igraph_adjacent_triangles}{\code{adjacent_triangles()}}.} diff --git a/man/degree.Rd b/man/degree.Rd index ecdbe6da027..098cf73fea2 100644 --- a/man/degree.Rd +++ b/man/degree.Rd @@ -101,5 +101,5 @@ Gabor Csardi \email{csardi.gabor@gmail.com} } \concept{structural.properties} \keyword{graphs} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_maxdegree}{\code{igraph_maxdegree()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_maxdegree}{\code{maxdegree()}}.} diff --git a/man/dim_select.Rd b/man/dim_select.Rd index 7752d085a4a..bbaa569d30f 100644 --- a/man/dim_select.Rd +++ b/man/dim_select.Rd @@ -78,5 +78,5 @@ Gabor Csardi \email{csardi.gabor@gmail.com} } \concept{embedding} \keyword{graphs} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Embedding.html#igraph_dim_select}{\code{igraph_dim_select()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Embedding.html#igraph_dim_select}{\code{dim_select()}}.} diff --git a/man/distances.Rd b/man/distances.Rd index daa0af446fd..aa3ebe96038 100644 --- a/man/distances.Rd +++ b/man/distances.Rd @@ -302,5 +302,5 @@ Gabor Csardi \email{csardi.gabor@gmail.com} \concept{paths} \concept{structural.properties} \keyword{graphs} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_path_length_hist}{\code{igraph_path_length_hist()}}, \href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_average_path_length_dijkstra}{\code{igraph_average_path_length_dijkstra()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_path_length_hist}{\code{path_length_hist()}}, \href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_average_path_length_dijkstra}{\code{average_path_length_dijkstra()}}.} diff --git a/man/diversity.Rd b/man/diversity.Rd index 5d11096e80e..570b68a7de6 100644 --- a/man/diversity.Rd +++ b/man/diversity.Rd @@ -71,5 +71,5 @@ Gabor Csardi \email{csardi.gabor@gmail.com} } \concept{centrality} \keyword{graphs} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_diversity}{\code{igraph_diversity()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_diversity}{\code{diversity()}}.} diff --git a/man/dyad_census.Rd b/man/dyad_census.Rd index fc52460a561..4f6ef6186fc 100644 --- a/man/dyad_census.Rd +++ b/man/dyad_census.Rd @@ -47,5 +47,5 @@ Gabor Csardi \email{csardi.gabor@gmail.com} } \concept{graph motifs} \keyword{graphs} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Motifs.html#igraph_dyad_census}{\code{igraph_dyad_census()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Motifs.html#igraph_dyad_census}{\code{dyad_census()}}.} diff --git a/man/eccentricity.Rd b/man/eccentricity.Rd index 6534da42be0..a4678a78d2d 100644 --- a/man/eccentricity.Rd +++ b/man/eccentricity.Rd @@ -68,5 +68,5 @@ Other paths: \code{\link{radius}()} } \concept{paths} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_eccentricity_dijkstra}{\code{igraph_eccentricity_dijkstra()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_eccentricity_dijkstra}{\code{eccentricity_dijkstra()}}.} diff --git a/man/edge_density.Rd b/man/edge_density.Rd index 58f9dde504f..99b4db0eb71 100644 --- a/man/edge_density.Rd +++ b/man/edge_density.Rd @@ -80,5 +80,5 @@ Gabor Csardi \email{csardi.gabor@gmail.com} } \concept{structural.properties} \keyword{graphs} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_density}{\code{igraph_density()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_density}{\code{density()}}.} diff --git a/man/eigen_centrality.Rd b/man/eigen_centrality.Rd index 6945c2bd970..9901e4f54ec 100644 --- a/man/eigen_centrality.Rd +++ b/man/eigen_centrality.Rd @@ -122,5 +122,5 @@ manual page. } \concept{centrality} \keyword{graphs} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_eigenvector_centrality}{\code{igraph_eigenvector_centrality()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_eigenvector_centrality}{\code{eigenvector_centrality()}}.} diff --git a/man/embed_adjacency_matrix.Rd b/man/embed_adjacency_matrix.Rd index 6bb0d299d86..edb0a9dba87 100644 --- a/man/embed_adjacency_matrix.Rd +++ b/man/embed_adjacency_matrix.Rd @@ -100,5 +100,5 @@ Other embedding: } \concept{embedding} \keyword{graphs} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Embedding.html#igraph_adjacency_spectral_embedding}{\code{igraph_adjacency_spectral_embedding()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Embedding.html#igraph_adjacency_spectral_embedding}{\code{adjacency_spectral_embedding()}}.} diff --git a/man/embed_laplacian_matrix.Rd b/man/embed_laplacian_matrix.Rd index 89672f6623b..885202c372c 100644 --- a/man/embed_laplacian_matrix.Rd +++ b/man/embed_laplacian_matrix.Rd @@ -110,5 +110,5 @@ Gabor Csardi \email{csardi.gabor@gmail.com} } \concept{embedding} \keyword{graphs} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Embedding.html#igraph_laplacian_spectral_embedding}{\code{igraph_laplacian_spectral_embedding()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Embedding.html#igraph_laplacian_spectral_embedding}{\code{laplacian_spectral_embedding()}}.} diff --git a/man/feedback_arc_set.Rd b/man/feedback_arc_set.Rd index 96f69653e82..a866e094727 100644 --- a/man/feedback_arc_set.Rd +++ b/man/feedback_arc_set.Rd @@ -86,5 +86,5 @@ Graph cycles \concept{cycles} \concept{structural.properties} \keyword{graphs} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_feedback_arc_set}{\code{igraph_feedback_arc_set()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_feedback_arc_set}{\code{feedback_arc_set()}}.} diff --git a/man/feedback_vertex_set.Rd b/man/feedback_vertex_set.Rd index afe8d3c9054..dd52f8b0eaf 100644 --- a/man/feedback_vertex_set.Rd +++ b/man/feedback_vertex_set.Rd @@ -72,5 +72,5 @@ Graph cycles \concept{cycles} \concept{structural.properties} \keyword{graphs} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_feedback_vertex_set}{\code{igraph_feedback_vertex_set()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_feedback_vertex_set}{\code{feedback_vertex_set()}}.} diff --git a/man/global_efficiency.Rd b/man/global_efficiency.Rd index 3e9758e8bc9..c2bff5b8b62 100644 --- a/man/global_efficiency.Rd +++ b/man/global_efficiency.Rd @@ -104,5 +104,5 @@ transfer in regular and complex networks, Phys. Rev. E 71, 1 (2005). } \concept{efficiency} \keyword{graphs} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_global_efficiency}{\code{igraph_global_efficiency()}}, \href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_local_efficiency}{\code{igraph_local_efficiency()}}, \href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_average_local_efficiency}{\code{igraph_average_local_efficiency()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_global_efficiency}{\code{global_efficiency()}}, \href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_local_efficiency}{\code{local_efficiency()}}, \href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_average_local_efficiency}{\code{average_local_efficiency()}}.} diff --git a/man/gorder.Rd b/man/gorder.Rd index 407d273fd05..afe05c576a4 100644 --- a/man/gorder.Rd +++ b/man/gorder.Rd @@ -40,5 +40,5 @@ Other structural queries: \code{\link{tail_of}()} } \concept{structural queries} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Basic.html#igraph_vcount}{\code{igraph_vcount()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Basic.html#igraph_vcount}{\code{vcount()}}.} diff --git a/man/graph.lattice.Rd b/man/graph.lattice.Rd index a7b0ed502ff..0435ebc7468 100644 --- a/man/graph.lattice.Rd +++ b/man/graph.lattice.Rd @@ -45,5 +45,5 @@ be extended to boolean vector with dimvector length.} consistent API. } \keyword{internal} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Generators.html#igraph_square_lattice}{\code{igraph_square_lattice()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Generators.html#igraph_square_lattice}{\code{square_lattice()}}.} diff --git a/man/graph_center.Rd b/man/graph_center.Rd index 92ff4cac8d8..edaa1075a6e 100644 --- a/man/graph_center.Rd +++ b/man/graph_center.Rd @@ -57,5 +57,5 @@ Other paths: \code{\link{radius}()} } \concept{paths} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_graph_center_dijkstra}{\code{igraph_graph_center_dijkstra()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_graph_center_dijkstra}{\code{graph_center_dijkstra()}}.} diff --git a/man/graph_from_adj_list.Rd b/man/graph_from_adj_list.Rd index 0ef1bd43ba8..f3881bdf42a 100644 --- a/man/graph_from_adj_list.Rd +++ b/man/graph_from_adj_list.Rd @@ -82,5 +82,5 @@ Gabor Csardi \email{csardi.gabor@gmail.com} } \concept{conversion} \keyword{graphs} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Generators.html#igraph_adjlist}{\code{igraph_adjlist()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Generators.html#igraph_adjlist}{\code{adjlist()}}.} diff --git a/man/graph_from_isomorphism_class.Rd b/man/graph_from_isomorphism_class.Rd index 554e7ffe698..0a74cf482b3 100644 --- a/man/graph_from_isomorphism_class.Rd +++ b/man/graph_from_isomorphism_class.Rd @@ -36,5 +36,5 @@ Other graph isomorphism: \code{\link{subgraph_isomorphisms}()} } \concept{graph isomorphism} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Isomorphism.html#igraph_isoclass_create}{\code{igraph_isoclass_create()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Isomorphism.html#igraph_isoclass_create}{\code{isoclass_create()}}.} diff --git a/man/graph_from_lcf.Rd b/man/graph_from_lcf.Rd index f5c52bef2b1..2ae9978e599 100644 --- a/man/graph_from_lcf.Rd +++ b/man/graph_from_lcf.Rd @@ -39,5 +39,5 @@ functions on the its manual page for creating special graphs. Gabor Csardi \email{csardi.gabor@gmail.com} } \keyword{graphs} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Generators.html#igraph_lcf_vector}{\code{igraph_lcf_vector()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Generators.html#igraph_lcf_vector}{\code{lcf_vector()}}.} diff --git a/man/graphlet_basis.Rd b/man/graphlet_basis.Rd index 2cf18b2cc6e..4971d8fa668 100644 --- a/man/graphlet_basis.Rd +++ b/man/graphlet_basis.Rd @@ -103,5 +103,5 @@ for (i in 1:length(gl$cliques)) { } } \concept{glet} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Graphlets.html#igraph_graphlets}{\code{igraph_graphlets()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Graphlets.html#igraph_graphlets}{\code{graphlets()}}.} diff --git a/man/greedy_vertex_coloring.Rd b/man/greedy_vertex_coloring.Rd index d6cf2ad5086..234169f164a 100644 --- a/man/greedy_vertex_coloring.Rd +++ b/man/greedy_vertex_coloring.Rd @@ -42,5 +42,5 @@ plot(g, vertex.color = col) } \concept{coloring} \keyword{graphs} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Coloring.html#igraph_vertex_coloring_greedy}{\code{igraph_vertex_coloring_greedy()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Coloring.html#igraph_vertex_coloring_greedy}{\code{vertex_coloring_greedy()}}.} diff --git a/man/harmonic_centrality.Rd b/man/harmonic_centrality.Rd index d6f7944adda..c70629c847d 100644 --- a/man/harmonic_centrality.Rd +++ b/man/harmonic_centrality.Rd @@ -85,5 +85,5 @@ Centrality measures } \concept{centrality} \keyword{graphs} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_harmonic_centrality_cutoff}{\code{igraph_harmonic_centrality_cutoff()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_harmonic_centrality_cutoff}{\code{harmonic_centrality_cutoff()}}.} diff --git a/man/has_eulerian_path.Rd b/man/has_eulerian_path.Rd index 62beee753c0..dad67cfda4b 100644 --- a/man/has_eulerian_path.Rd +++ b/man/has_eulerian_path.Rd @@ -66,5 +66,5 @@ Graph cycles } \concept{cycles} \keyword{graphs} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Cycles.html#igraph_is_eulerian}{\code{igraph_is_eulerian()}}, \href{https://igraph.org/c/html/latest/igraph-Cycles.html#igraph_eulerian_path}{\code{igraph_eulerian_path()}}, \href{https://igraph.org/c/html/latest/igraph-Cycles.html#igraph_eulerian_cycle}{\code{igraph_eulerian_cycle()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Cycles.html#igraph_is_eulerian}{\code{is_eulerian()}}, \href{https://igraph.org/c/html/latest/igraph-Cycles.html#igraph_eulerian_path}{\code{eulerian_path()}}, \href{https://igraph.org/c/html/latest/igraph-Cycles.html#igraph_eulerian_cycle}{\code{eulerian_cycle()}}.} diff --git a/man/hits_scores.Rd b/man/hits_scores.Rd index f216a6ab66c..021af815582 100644 --- a/man/hits_scores.Rd +++ b/man/hits_scores.Rd @@ -89,5 +89,5 @@ Centrality measures \code{\link{subgraph_centrality}()} } \concept{centrality} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_hub_and_authority_scores}{\code{igraph_hub_and_authority_scores()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_hub_and_authority_scores}{\code{hub_and_authority_scores()}}.} diff --git a/man/hrg.Rd b/man/hrg.Rd index 587a07bf52c..4eff251cef8 100644 --- a/man/hrg.Rd +++ b/man/hrg.Rd @@ -33,5 +33,5 @@ Other hierarchical random graph functions: \code{\link{sample_hrg}()} } \concept{hierarchical random graph functions} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-HRG.html#igraph_hrg_create}{\code{igraph_hrg_create()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-HRG.html#igraph_hrg_create}{\code{hrg_create()}}.} diff --git a/man/hrg_tree.Rd b/man/hrg_tree.Rd index 212f961e044..e3dcca5003b 100644 --- a/man/hrg_tree.Rd +++ b/man/hrg_tree.Rd @@ -28,5 +28,5 @@ Other hierarchical random graph functions: \code{\link{sample_hrg}()} } \concept{hierarchical random graph functions} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-HRG.html#igraph_from_hrg_dendrogram}{\code{igraph_from_hrg_dendrogram()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-HRG.html#igraph_from_hrg_dendrogram}{\code{from_hrg_dendrogram()}}.} diff --git a/man/is_acyclic.Rd b/man/is_acyclic.Rd index 8dea7c3fee7..051e764a986 100644 --- a/man/is_acyclic.Rd +++ b/man/is_acyclic.Rd @@ -65,5 +65,5 @@ Other structural.properties: \concept{cycles} \concept{structural.properties} \keyword{graphs} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_is_acyclic}{\code{igraph_is_acyclic()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_is_acyclic}{\code{is_acyclic()}}.} diff --git a/man/is_biconnected.Rd b/man/is_biconnected.Rd index 537d064a257..16f847b1bae 100644 --- a/man/is_biconnected.Rd +++ b/man/is_biconnected.Rd @@ -44,5 +44,5 @@ Connected components } \concept{components} \keyword{graphs} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_is_biconnected}{\code{igraph_is_biconnected()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_is_biconnected}{\code{is_biconnected()}}.} diff --git a/man/is_dag.Rd b/man/is_dag.Rd index 91516c09d46..eeee7dd4f2b 100644 --- a/man/is_dag.Rd +++ b/man/is_dag.Rd @@ -69,5 +69,5 @@ Tamas Nepusz \email{ntamas@gmail.com} for the C code, Gabor Csardi \concept{cycles} \concept{structural.properties} \keyword{graphs} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_is_dag}{\code{igraph_is_dag()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_is_dag}{\code{is_dag()}}.} diff --git a/man/is_forest.Rd b/man/is_forest.Rd index 9c8f9419a58..bfe69589318 100644 --- a/man/is_forest.Rd +++ b/man/is_forest.Rd @@ -54,5 +54,5 @@ Other trees: } \concept{trees} \keyword{graphs} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_is_forest}{\code{igraph_is_forest()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_is_forest}{\code{is_forest()}}.} diff --git a/man/is_graphical.Rd b/man/is_graphical.Rd index 7668903810c..6c10001c9be 100644 --- a/man/is_graphical.Rd +++ b/man/is_graphical.Rd @@ -58,5 +58,5 @@ Tamás Nepusz \email{ntamas@gmail.com} } \concept{graphical degree sequences} \keyword{graphs} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_is_graphical}{\code{igraph_is_graphical()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_is_graphical}{\code{is_graphical()}}.} diff --git a/man/is_min_separator.Rd b/man/is_min_separator.Rd index 15578afaf3f..69bc91bdcd1 100644 --- a/man/is_min_separator.Rd +++ b/man/is_min_separator.Rd @@ -69,5 +69,5 @@ Other flow: \code{\link{vertex_connectivity}()} } \concept{flow} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Separators.html#igraph_is_minimal_separator}{\code{igraph_is_minimal_separator()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Separators.html#igraph_is_minimal_separator}{\code{is_minimal_separator()}}.} diff --git a/man/is_separator.Rd b/man/is_separator.Rd index 49ff54ed396..6906cf8fba8 100644 --- a/man/is_separator.Rd +++ b/man/is_separator.Rd @@ -48,5 +48,5 @@ Other flow: \code{\link{vertex_connectivity}()} } \concept{flow} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Separators.html#igraph_is_separator}{\code{igraph_is_separator()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Separators.html#igraph_is_separator}{\code{is_separator()}}.} diff --git a/man/is_tree.Rd b/man/is_tree.Rd index 22a52ecf6a1..cca88079f47 100644 --- a/man/is_tree.Rd +++ b/man/is_tree.Rd @@ -56,5 +56,5 @@ Other trees: } \concept{trees} \keyword{graphs} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_is_tree}{\code{igraph_is_tree()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_is_tree}{\code{is_tree()}}.} diff --git a/man/k_shortest_paths.Rd b/man/k_shortest_paths.Rd index 52b3a788f56..d238a1cab53 100644 --- a/man/k_shortest_paths.Rd +++ b/man/k_shortest_paths.Rd @@ -87,5 +87,5 @@ Other structural.properties: } \concept{structural.properties} \keyword{graphs} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_get_k_shortest_paths}{\code{igraph_get_k_shortest_paths()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_get_k_shortest_paths}{\code{get_k_shortest_paths()}}.} diff --git a/man/knn.Rd b/man/knn.Rd index 8aa63dea2a9..5874c1eec78 100644 --- a/man/knn.Rd +++ b/man/knn.Rd @@ -120,5 +120,5 @@ Gabor Csardi \email{csardi.gabor@gmail.com} } \concept{structural.properties} \keyword{graphs} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_avg_nearest_neighbor_degree}{\code{igraph_avg_nearest_neighbor_degree()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_avg_nearest_neighbor_degree}{\code{avg_nearest_neighbor_degree()}}.} diff --git a/man/laplacian_matrix.Rd b/man/laplacian_matrix.Rd index 2bc29747de5..f21be5f5e72 100644 --- a/man/laplacian_matrix.Rd +++ b/man/laplacian_matrix.Rd @@ -77,5 +77,5 @@ laplacian_matrix(g, normalization = "unnormalized", sparse = FALSE) Gabor Csardi \email{csardi.gabor@gmail.com} } \keyword{graphs} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_get_laplacian}{\code{igraph_get_laplacian()}}, \href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_get_laplacian_sparse}{\code{igraph_get_laplacian_sparse()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_get_laplacian}{\code{get_laplacian()}}, \href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_get_laplacian_sparse}{\code{get_laplacian_sparse()}}.} diff --git a/man/make_empty_graph.Rd b/man/make_empty_graph.Rd index d8088989678..030f1ed1b97 100644 --- a/man/make_empty_graph.Rd +++ b/man/make_empty_graph.Rd @@ -43,5 +43,5 @@ Other deterministic constructors: } \concept{Empty graph.} \concept{deterministic constructors} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Basic.html#igraph_empty}{\code{igraph_empty()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Basic.html#igraph_empty}{\code{empty()}}.} diff --git a/man/make_from_prufer.Rd b/man/make_from_prufer.Rd index fd12f3af6e1..6a1680bc05f 100644 --- a/man/make_from_prufer.Rd +++ b/man/make_from_prufer.Rd @@ -44,5 +44,5 @@ Other trees: } \concept{trees} \keyword{graphs} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Generators.html#igraph_from_prufer}{\code{igraph_from_prufer()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Generators.html#igraph_from_prufer}{\code{from_prufer()}}.} diff --git a/man/make_lattice.Rd b/man/make_lattice.Rd index 2f342953038..52e2dfe39cb 100644 --- a/man/make_lattice.Rd +++ b/man/make_lattice.Rd @@ -74,5 +74,5 @@ Other deterministic constructors: } \concept{Lattice} \concept{deterministic constructors} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Generators.html#igraph_square_lattice}{\code{igraph_square_lattice()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Generators.html#igraph_square_lattice}{\code{square_lattice()}}.} diff --git a/man/max_cardinality.Rd b/man/max_cardinality.Rd index 4f7150b300d..1dde1ac3e2d 100644 --- a/man/max_cardinality.Rd +++ b/man/max_cardinality.Rd @@ -66,5 +66,5 @@ Gabor Csardi \email{csardi.gabor@gmail.com} } \concept{chordal} \keyword{graphs} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_maximum_cardinality_search}{\code{igraph_maximum_cardinality_search()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_maximum_cardinality_search}{\code{maximum_cardinality_search()}}.} diff --git a/man/max_flow.Rd b/man/max_flow.Rd index 7b6c009a9c1..9ab924d0ef2 100644 --- a/man/max_flow.Rd +++ b/man/max_flow.Rd @@ -84,5 +84,5 @@ Other flow: \code{\link{vertex_connectivity}()} } \concept{flow} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Flows.html#igraph_maxflow}{\code{igraph_maxflow()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Flows.html#igraph_maxflow}{\code{maxflow()}}.} diff --git a/man/min_separators.Rd b/man/min_separators.Rd index f14d553a53e..98820f46df5 100644 --- a/man/min_separators.Rd +++ b/man/min_separators.Rd @@ -92,5 +92,5 @@ Other flow: \code{\link{vertex_connectivity}()} } \concept{flow} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Separators.html#igraph_minimum_size_separators}{\code{igraph_minimum_size_separators()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Separators.html#igraph_minimum_size_separators}{\code{minimum_size_separators()}}.} diff --git a/man/min_st_separators.Rd b/man/min_st_separators.Rd index be4938da3fc..6a1924654d3 100644 --- a/man/min_st_separators.Rd +++ b/man/min_st_separators.Rd @@ -84,5 +84,5 @@ Gabor Csardi \email{csardi.gabor@gmail.com} } \concept{flow} \keyword{graphs} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Separators.html#igraph_all_minimal_st_separators}{\code{igraph_all_minimal_st_separators()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Separators.html#igraph_all_minimal_st_separators}{\code{all_minimal_st_separators()}}.} diff --git a/man/page_rank.Rd b/man/page_rank.Rd index 0f14a4960f8..ca6089e2429 100644 --- a/man/page_rank.Rd +++ b/man/page_rank.Rd @@ -128,5 +128,5 @@ Tamas Nepusz \email{ntamas@gmail.com} and Gabor Csardi } \concept{centrality} \keyword{graphs} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_personalized_pagerank}{\code{igraph_personalized_pagerank()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_personalized_pagerank}{\code{personalized_pagerank()}}.} diff --git a/man/permute.Rd b/man/permute.Rd index ee3c3fda3cb..2dab221f426 100644 --- a/man/permute.Rd +++ b/man/permute.Rd @@ -78,5 +78,5 @@ Gabor Csardi \email{csardi.gabor@gmail.com} } \concept{functions for manipulating graph structure} \keyword{graphs} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Isomorphism.html#igraph_permute_vertices}{\code{igraph_permute_vertices()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Isomorphism.html#igraph_permute_vertices}{\code{permute_vertices()}}.} diff --git a/man/radius.Rd b/man/radius.Rd index c090f1fa3f1..16cb54ccbe5 100644 --- a/man/radius.Rd +++ b/man/radius.Rd @@ -61,5 +61,5 @@ Other paths: \code{\link{graph_center}()} } \concept{paths} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_radius_dijkstra}{\code{igraph_radius_dijkstra()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_radius_dijkstra}{\code{radius_dijkstra()}}.} diff --git a/man/random_walk.Rd b/man/random_walk.Rd index c08ab2f928d..22105a3c221 100644 --- a/man/random_walk.Rd +++ b/man/random_walk.Rd @@ -81,5 +81,5 @@ cor(table(w), ec) cor(table(w), pg) } \concept{random_walk} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Visitors.html#igraph_random_walk}{\code{igraph_random_walk()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Visitors.html#igraph_random_walk}{\code{random_walk()}}.} diff --git a/man/read_graph.Rd b/man/read_graph.Rd index eec410f9ff5..ddbf15b9ca5 100644 --- a/man/read_graph.Rd +++ b/man/read_graph.Rd @@ -102,5 +102,5 @@ Gabor Csardi \email{csardi.gabor@gmail.com} } \concept{foreign} \keyword{graphs} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Foreign.html#igraph_read_graph_dimacs_flow}{\code{igraph_read_graph_dimacs_flow()}}, \href{https://igraph.org/c/html/latest/igraph-Foreign.html#igraph_read_graph_dl}{\code{igraph_read_graph_dl()}}, \href{https://igraph.org/c/html/latest/igraph-Foreign.html#igraph_read_graph_edgelist}{\code{igraph_read_graph_edgelist()}}, \href{https://igraph.org/c/html/latest/igraph-Foreign.html#igraph_read_graph_gml}{\code{igraph_read_graph_gml()}}, \href{https://igraph.org/c/html/latest/igraph-Foreign.html#igraph_read_graph_graphdb}{\code{igraph_read_graph_graphdb()}}, \href{https://igraph.org/c/html/latest/igraph-Foreign.html#igraph_read_graph_graphml}{\code{igraph_read_graph_graphml()}}, \href{https://igraph.org/c/html/latest/igraph-Foreign.html#igraph_read_graph_lgl}{\code{igraph_read_graph_lgl()}}, \href{https://igraph.org/c/html/latest/igraph-Foreign.html#igraph_read_graph_ncol}{\code{igraph_read_graph_ncol()}}, \href{https://igraph.org/c/html/latest/igraph-Foreign.html#igraph_read_graph_pajek}{\code{igraph_read_graph_pajek()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Foreign.html#igraph_read_graph_dimacs_flow}{\code{read_graph_dimacs_flow()}}, \href{https://igraph.org/c/html/latest/igraph-Foreign.html#igraph_read_graph_dl}{\code{read_graph_dl()}}, \href{https://igraph.org/c/html/latest/igraph-Foreign.html#igraph_read_graph_edgelist}{\code{read_graph_edgelist()}}, \href{https://igraph.org/c/html/latest/igraph-Foreign.html#igraph_read_graph_gml}{\code{read_graph_gml()}}, \href{https://igraph.org/c/html/latest/igraph-Foreign.html#igraph_read_graph_graphdb}{\code{read_graph_graphdb()}}, \href{https://igraph.org/c/html/latest/igraph-Foreign.html#igraph_read_graph_graphml}{\code{read_graph_graphml()}}, \href{https://igraph.org/c/html/latest/igraph-Foreign.html#igraph_read_graph_lgl}{\code{read_graph_lgl()}}, \href{https://igraph.org/c/html/latest/igraph-Foreign.html#igraph_read_graph_ncol}{\code{read_graph_ncol()}}, \href{https://igraph.org/c/html/latest/igraph-Foreign.html#igraph_read_graph_pajek}{\code{read_graph_pajek()}}.} diff --git a/man/realize_bipartite_degseq.Rd b/man/realize_bipartite_degseq.Rd index 3ffc5e60ce4..873e9d12c04 100644 --- a/man/realize_bipartite_degseq.Rd +++ b/man/realize_bipartite_degseq.Rd @@ -60,5 +60,5 @@ degree(g) \code{\link[=realize_degseq]{realize_degseq()}} to create a not necessarily bipartite graph. } \keyword{graphs} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Generators.html#igraph_realize_bipartite_degree_sequence}{\code{igraph_realize_bipartite_degree_sequence()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Generators.html#igraph_realize_bipartite_degree_sequence}{\code{realize_bipartite_degree_sequence()}}.} diff --git a/man/realize_degseq.Rd b/man/realize_degseq.Rd index 7ddbaca212a..8b2e2fcad2b 100644 --- a/man/realize_degseq.Rd +++ b/man/realize_degseq.Rd @@ -111,5 +111,5 @@ Connectedness matters: construction and exact random sampling of connected netwo from graphs with the given degree sequence. } \keyword{graphs} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Generators.html#igraph_realize_degree_sequence}{\code{igraph_realize_degree_sequence()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Generators.html#igraph_realize_degree_sequence}{\code{realize_degree_sequence()}}.} diff --git a/man/reciprocity.Rd b/man/reciprocity.Rd index b2a7c4516d3..72b71313216 100644 --- a/man/reciprocity.Rd +++ b/man/reciprocity.Rd @@ -74,5 +74,5 @@ Tamas Nepusz \email{ntamas@gmail.com} and Gabor Csardi } \concept{structural.properties} \keyword{graphs} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_reciprocity}{\code{igraph_reciprocity()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_reciprocity}{\code{reciprocity()}}.} diff --git a/man/reverse_edges.Rd b/man/reverse_edges.Rd index b1dc988009a..37bc5bbc38c 100644 --- a/man/reverse_edges.Rd +++ b/man/reverse_edges.Rd @@ -58,5 +58,5 @@ Other functions for manipulating graph structure: \code{\link{vertex}()} } \concept{functions for manipulating graph structure} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Operators.html#igraph_reverse_edges}{\code{igraph_reverse_edges()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Operators.html#igraph_reverse_edges}{\code{reverse_edges()}}.} diff --git a/man/sample_chung_lu.Rd b/man/sample_chung_lu.Rd index e5040eda4d7..52de7869b7c 100644 --- a/man/sample_chung_lu.Rd +++ b/man/sample_chung_lu.Rd @@ -196,5 +196,5 @@ Random graph models (games) \code{\link{sample_tree}()} } \concept{games} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Generators.html#igraph_chung_lu_game}{\code{igraph_chung_lu_game()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Generators.html#igraph_chung_lu_game}{\code{chung_lu_game()}}.} diff --git a/man/sample_correlated_gnp.Rd b/man/sample_correlated_gnp.Rd index 563730a3498..215c5f1c4c3 100644 --- a/man/sample_correlated_gnp.Rd +++ b/man/sample_correlated_gnp.Rd @@ -84,5 +84,5 @@ Random graph models (games) \code{\link{sample_tree}()} } \concept{games} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Generators.html#igraph_correlated_game}{\code{igraph_correlated_game()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Generators.html#igraph_correlated_game}{\code{correlated_game()}}.} diff --git a/man/sample_correlated_gnp_pair.Rd b/man/sample_correlated_gnp_pair.Rd index f6ba5cfd959..8244f3a5bcc 100644 --- a/man/sample_correlated_gnp_pair.Rd +++ b/man/sample_correlated_gnp_pair.Rd @@ -78,5 +78,5 @@ Random graph models (games) } \concept{games} \keyword{graphs} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Generators.html#igraph_correlated_pair_game}{\code{igraph_correlated_pair_game()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Generators.html#igraph_correlated_pair_game}{\code{correlated_pair_game()}}.} diff --git a/man/sample_dot_product.Rd b/man/sample_dot_product.Rd index f658f4e08bd..44e6f018a5a 100644 --- a/man/sample_dot_product.Rd +++ b/man/sample_dot_product.Rd @@ -89,5 +89,5 @@ Gabor Csardi \email{csardi.gabor@gmail.com} } \concept{games} \keyword{graphs} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Generators.html#igraph_dot_product_game}{\code{igraph_dot_product_game()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Generators.html#igraph_dot_product_game}{\code{dot_product_game()}}.} diff --git a/man/sample_fitness.Rd b/man/sample_fitness.Rd index 6b8c34bf655..1502423df95 100644 --- a/man/sample_fitness.Rd +++ b/man/sample_fitness.Rd @@ -111,5 +111,5 @@ Tamas Nepusz \email{ntamas@gmail.com} } \concept{games} \keyword{graphs} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Generators.html#igraph_static_fitness_game}{\code{igraph_static_fitness_game()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Generators.html#igraph_static_fitness_game}{\code{static_fitness_game()}}.} diff --git a/man/sample_fitness_pl.Rd b/man/sample_fitness_pl.Rd index 18e547e3f7e..166c910685a 100644 --- a/man/sample_fitness_pl.Rd +++ b/man/sample_fitness_pl.Rd @@ -120,5 +120,5 @@ Tamas Nepusz \email{ntamas@gmail.com} } \concept{games} \keyword{graphs} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Generators.html#igraph_static_power_law_game}{\code{igraph_static_power_law_game()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Generators.html#igraph_static_power_law_game}{\code{static_power_law_game()}}.} diff --git a/man/sample_forestfire.Rd b/man/sample_forestfire.Rd index 1d6c6f9765a..432851c53d6 100644 --- a/man/sample_forestfire.Rd +++ b/man/sample_forestfire.Rd @@ -109,5 +109,5 @@ Gabor Csardi \email{csardi.gabor@gmail.com} } \concept{games} \keyword{graphs} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Generators.html#igraph_forest_fire_game}{\code{igraph_forest_fire_game()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Generators.html#igraph_forest_fire_game}{\code{forest_fire_game()}}.} diff --git a/man/sample_growing.Rd b/man/sample_growing.Rd index ab7826d489b..6423905fb78 100644 --- a/man/sample_growing.Rd +++ b/man/sample_growing.Rd @@ -74,5 +74,5 @@ Gabor Csardi \email{csardi.gabor@gmail.com} } \concept{games} \keyword{graphs} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Generators.html#igraph_growing_random_game}{\code{igraph_growing_random_game()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Generators.html#igraph_growing_random_game}{\code{growing_random_game()}}.} diff --git a/man/sample_hierarchical_sbm.Rd b/man/sample_hierarchical_sbm.Rd index 9add7bba7de..9f7e79f906e 100644 --- a/man/sample_hierarchical_sbm.Rd +++ b/man/sample_hierarchical_sbm.Rd @@ -91,5 +91,5 @@ Gabor Csardi \email{csardi.gabor@gmail.com} } \concept{games} \keyword{graphs} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Generators.html#igraph_hsbm_game}{\code{igraph_hsbm_game()}}, \href{https://igraph.org/c/html/latest/igraph-Generators.html#igraph_hsbm_list_game}{\code{igraph_hsbm_list_game()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Generators.html#igraph_hsbm_game}{\code{hsbm_game()}}, \href{https://igraph.org/c/html/latest/igraph-Generators.html#igraph_hsbm_list_game}{\code{hsbm_list_game()}}.} diff --git a/man/sample_hrg.Rd b/man/sample_hrg.Rd index f9ab8832599..410101be394 100644 --- a/man/sample_hrg.Rd +++ b/man/sample_hrg.Rd @@ -28,5 +28,5 @@ Other hierarchical random graph functions: \code{\link{print.igraphHRGConsensus}()} } \concept{hierarchical random graph functions} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-HRG.html#igraph_hrg_game}{\code{igraph_hrg_game()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-HRG.html#igraph_hrg_game}{\code{hrg_game()}}.} diff --git a/man/sample_islands.Rd b/man/sample_islands.Rd index be031b3f023..20c0536f2fe 100644 --- a/man/sample_islands.Rd +++ b/man/sample_islands.Rd @@ -68,5 +68,5 @@ Samuel Thiriot } \concept{games} \keyword{graphs} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Generators.html#igraph_simple_interconnected_islands_game}{\code{igraph_simple_interconnected_islands_game()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Generators.html#igraph_simple_interconnected_islands_game}{\code{simple_interconnected_islands_game()}}.} diff --git a/man/sample_k_regular.Rd b/man/sample_k_regular.Rd index 82583292740..102511c17da 100644 --- a/man/sample_k_regular.Rd +++ b/man/sample_k_regular.Rd @@ -80,5 +80,5 @@ Tamas Nepusz \email{ntamas@gmail.com} } \concept{games} \keyword{graphs} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Generators.html#igraph_k_regular_game}{\code{igraph_k_regular_game()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Generators.html#igraph_k_regular_game}{\code{k_regular_game()}}.} diff --git a/man/sample_sbm.Rd b/man/sample_sbm.Rd index c771995ca82..e11e2c4315a 100644 --- a/man/sample_sbm.Rd +++ b/man/sample_sbm.Rd @@ -85,5 +85,5 @@ Gabor Csardi \email{csardi.gabor@gmail.com} } \concept{games} \keyword{graphs} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Generators.html#igraph_sbm_game}{\code{igraph_sbm_game()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Generators.html#igraph_sbm_game}{\code{sbm_game()}}.} diff --git a/man/sample_spanning_tree.Rd b/man/sample_spanning_tree.Rd index 2d0545b3178..69efb56e52b 100644 --- a/man/sample_spanning_tree.Rd +++ b/man/sample_spanning_tree.Rd @@ -43,5 +43,5 @@ Other trees: } \concept{trees} \keyword{graph} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_random_spanning_tree}{\code{igraph_random_spanning_tree()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_random_spanning_tree}{\code{random_spanning_tree()}}.} diff --git a/man/sample_tree.Rd b/man/sample_tree.Rd index a5c600ba8f5..f2e025926a5 100644 --- a/man/sample_tree.Rd +++ b/man/sample_tree.Rd @@ -66,5 +66,5 @@ Random graph models (games) } \concept{games} \keyword{graphs} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Generators.html#igraph_tree_game}{\code{igraph_tree_game()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Generators.html#igraph_tree_game}{\code{tree_game()}}.} diff --git a/man/similarity.Rd b/man/similarity.Rd index 8a721c823d5..5f124a707bc 100644 --- a/man/similarity.Rd +++ b/man/similarity.Rd @@ -78,5 +78,5 @@ Tamas Nepusz \email{ntamas@gmail.com} and Gabor Csardi \concept{cocitation} \concept{similarity} \keyword{graphs} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_similarity_jaccard}{\code{igraph_similarity_jaccard()}}, \href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_similarity_dice}{\code{igraph_similarity_dice()}}, \href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_similarity_inverse_log_weighted}{\code{igraph_similarity_inverse_log_weighted()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_similarity_jaccard}{\code{similarity_jaccard()}}, \href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_similarity_dice}{\code{similarity_dice()}}, \href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_similarity_inverse_log_weighted}{\code{similarity_inverse_log_weighted()}}.} diff --git a/man/simplify.Rd b/man/simplify.Rd index 564889e89de..9ebaa39c3ca 100644 --- a/man/simplify.Rd +++ b/man/simplify.Rd @@ -103,5 +103,5 @@ Gabor Csardi \email{csardi.gabor@gmail.com} \concept{isomorphism} \concept{simple} \keyword{graphs} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Operators.html#igraph_simplify}{\code{igraph_simplify()}}, \href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_is_simple}{\code{igraph_is_simple()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Operators.html#igraph_simplify}{\code{simplify()}}, \href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_is_simple}{\code{is_simple()}}.} diff --git a/man/sir.Rd b/man/sir.Rd index 4a18a428ff8..6bfe884bcda 100644 --- a/man/sir.Rd +++ b/man/sir.Rd @@ -119,5 +119,5 @@ Gabor Csardi \email{csardi.gabor@gmail.com}. Eric Kolaczyk } \concept{processes} \keyword{graphs} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Spatial-Games.html#igraph_sir}{\code{igraph_sir()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Spatial-Games.html#igraph_sir}{\code{sir()}}.} diff --git a/man/st_cuts.Rd b/man/st_cuts.Rd index d8922a74bcd..20fb618e09f 100644 --- a/man/st_cuts.Rd +++ b/man/st_cuts.Rd @@ -66,5 +66,5 @@ Gabor Csardi \email{csardi.gabor@gmail.com} } \concept{flow} \keyword{graphs} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Flows.html#igraph_all_st_cuts}{\code{igraph_all_st_cuts()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Flows.html#igraph_all_st_cuts}{\code{all_st_cuts()}}.} diff --git a/man/st_min_cuts.Rd b/man/st_min_cuts.Rd index 111c13a6041..efa7d1df960 100644 --- a/man/st_min_cuts.Rd +++ b/man/st_min_cuts.Rd @@ -76,5 +76,5 @@ Gabor Csardi \email{csardi.gabor@gmail.com} } \concept{flow} \keyword{graphs} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Flows.html#igraph_all_st_mincuts}{\code{igraph_all_st_mincuts()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Flows.html#igraph_all_st_mincuts}{\code{all_st_mincuts()}}.} diff --git a/man/strength.Rd b/man/strength.Rd index 20956112c6d..76a2e34f9b6 100644 --- a/man/strength.Rd +++ b/man/strength.Rd @@ -74,5 +74,5 @@ Gabor Csardi \email{csardi.gabor@gmail.com} } \concept{centrality} \keyword{graphs} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_strength}{\code{igraph_strength()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_strength}{\code{strength()}}.} diff --git a/man/to_prufer.Rd b/man/to_prufer.Rd index 9ddaa6b9206..38d7ceee139 100644 --- a/man/to_prufer.Rd +++ b/man/to_prufer.Rd @@ -41,5 +41,5 @@ Other trees: } \concept{trees} \keyword{graphs} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_to_prufer}{\code{igraph_to_prufer()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_to_prufer}{\code{to_prufer()}}.} diff --git a/man/triad_census.Rd b/man/triad_census.Rd index 9014898a624..58d7c144d45 100644 --- a/man/triad_census.Rd +++ b/man/triad_census.Rd @@ -54,5 +54,5 @@ Gabor Csardi \email{csardi.gabor@gmail.com} } \concept{motifs} \keyword{graphs} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Motifs.html#igraph_triad_census}{\code{igraph_triad_census()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Motifs.html#igraph_triad_census}{\code{triad_census()}}.} diff --git a/man/voronoi_cells.Rd b/man/voronoi_cells.Rd index 25cdc2edd90..0c674fa9685 100644 --- a/man/voronoi_cells.Rd +++ b/man/voronoi_cells.Rd @@ -85,5 +85,5 @@ Community detection \code{\link{split_join_distance}()} } \concept{community} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_voronoi}{\code{igraph_voronoi()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_voronoi}{\code{voronoi()}}.} diff --git a/man/weighted_cliques.Rd b/man/weighted_cliques.Rd index 0718dd33aab..87620a75a82 100644 --- a/man/weighted_cliques.Rd +++ b/man/weighted_cliques.Rd @@ -75,5 +75,5 @@ Tamas Nepusz \email{ntamas@gmail.com} and Gabor Csardi } \concept{cliques} \keyword{graphs} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Cliques.html#igraph_weighted_cliques}{\code{igraph_weighted_cliques()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Cliques.html#igraph_weighted_cliques}{\code{weighted_cliques()}}.} diff --git a/man/which_multiple.Rd b/man/which_multiple.Rd index fface1e42e5..c7ae8a79065 100644 --- a/man/which_multiple.Rd +++ b/man/which_multiple.Rd @@ -116,5 +116,5 @@ Gabor Csardi \email{csardi.gabor@gmail.com} } \concept{structural.properties} \keyword{graphs} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_is_multiple}{\code{igraph_is_multiple()}}, \href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_has_multiple}{\code{igraph_has_multiple()}}, \href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_count_multiple}{\code{igraph_count_multiple()}}, \href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_is_loop}{\code{igraph_is_loop()}}, \href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_has_loop}{\code{igraph_has_loop()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_is_multiple}{\code{is_multiple()}}, \href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_has_multiple}{\code{has_multiple()}}, \href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_count_multiple}{\code{count_multiple()}}, \href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_is_loop}{\code{is_loop()}}, \href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_has_loop}{\code{has_loop()}}.} diff --git a/man/which_mutual.Rd b/man/which_mutual.Rd index 7cddaf2afc2..9acbed38d8d 100644 --- a/man/which_mutual.Rd +++ b/man/which_mutual.Rd @@ -73,5 +73,5 @@ Gabor Csardi \email{csardi.gabor@gmail.com} } \concept{structural.properties} \keyword{graphs} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_is_mutual}{\code{igraph_is_mutual()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Structural.html#igraph_is_mutual}{\code{is_mutual()}}.} diff --git a/man/write_graph.Rd b/man/write_graph.Rd index e3e2571bc86..388e15b72bf 100644 --- a/man/write_graph.Rd +++ b/man/write_graph.Rd @@ -85,5 +85,5 @@ Gabor Csardi \email{csardi.gabor@gmail.com} } \concept{foreign} \keyword{graphs} -\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Foreign.html#igraph_write_graph_dimacs_flow}{\code{igraph_write_graph_dimacs_flow()}}, \href{https://igraph.org/c/html/latest/igraph-Foreign.html#igraph_write_graph_dot}{\code{igraph_write_graph_dot()}}, \href{https://igraph.org/c/html/latest/igraph-Foreign.html#igraph_write_graph_edgelist}{\code{igraph_write_graph_edgelist()}}, \href{https://igraph.org/c/html/latest/igraph-Foreign.html#igraph_write_graph_gml}{\code{igraph_write_graph_gml()}}, \href{https://igraph.org/c/html/latest/igraph-Foreign.html#igraph_write_graph_graphml}{\code{igraph_write_graph_graphml()}}, \href{https://igraph.org/c/html/latest/igraph-Foreign.html#igraph_write_graph_leda}{\code{igraph_write_graph_leda()}}, \href{https://igraph.org/c/html/latest/igraph-Foreign.html#igraph_write_graph_lgl}{\code{igraph_write_graph_lgl()}}, \href{https://igraph.org/c/html/latest/igraph-Foreign.html#igraph_write_graph_ncol}{\code{igraph_write_graph_ncol()}}, \href{https://igraph.org/c/html/latest/igraph-Foreign.html#igraph_write_graph_pajek}{\code{igraph_write_graph_pajek()}}.} +\section{Related documentation in the C library}{\href{https://igraph.org/c/html/latest/igraph-Foreign.html#igraph_write_graph_dimacs_flow}{\code{write_graph_dimacs_flow()}}, \href{https://igraph.org/c/html/latest/igraph-Foreign.html#igraph_write_graph_dot}{\code{write_graph_dot()}}, \href{https://igraph.org/c/html/latest/igraph-Foreign.html#igraph_write_graph_edgelist}{\code{write_graph_edgelist()}}, \href{https://igraph.org/c/html/latest/igraph-Foreign.html#igraph_write_graph_gml}{\code{write_graph_gml()}}, \href{https://igraph.org/c/html/latest/igraph-Foreign.html#igraph_write_graph_graphml}{\code{write_graph_graphml()}}, \href{https://igraph.org/c/html/latest/igraph-Foreign.html#igraph_write_graph_leda}{\code{write_graph_leda()}}, \href{https://igraph.org/c/html/latest/igraph-Foreign.html#igraph_write_graph_lgl}{\code{write_graph_lgl()}}, \href{https://igraph.org/c/html/latest/igraph-Foreign.html#igraph_write_graph_ncol}{\code{write_graph_ncol()}}, \href{https://igraph.org/c/html/latest/igraph-Foreign.html#igraph_write_graph_pajek}{\code{write_graph_pajek()}}.} From 08bbba5f0c3aa08b00d9c8d9e7f4136ea106ed06 Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?Kirill=20M=C3=BCller?= Date: Thu, 20 Mar 2025 11:09:46 +0100 Subject: [PATCH 6/8] Unreachable --- R/games.R | 2 ++ 1 file changed, 2 insertions(+) diff --git a/R/games.R b/R/games.R index dbe28ae9150..b5e19430187 100644 --- a/R/games.R +++ b/R/games.R @@ -1765,6 +1765,8 @@ sample_bipartite <- function(n1, n2, type = c("gnp", "gnm"), p, m, "sample_bipartite_gnm()" ) sample_bipartite_gnm(n1, n2, m, directed = directed, mode = mode) + } else { + cli::cli_abort("Unreachable", .internal = TRUE) } } From 0305eca5714776fb21c743a57b922d624d7ea703 Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?Kirill=20M=C3=BCller?= Date: Thu, 20 Mar 2025 11:48:45 +0100 Subject: [PATCH 7/8] Resolve drift --- R/aaa-auto.R | 4 +--- R/games.R | 15 +++++++++------ tools/stimulus/functions-R.yaml | 10 ++++++++-- tools/stimulus/types-RC.yaml | 14 ++++++++++++++ tools/stimulus/types-RR.yaml | 2 ++ 5 files changed, 34 insertions(+), 11 deletions(-) diff --git a/R/aaa-auto.R b/R/aaa-auto.R index 37c18eb71e5..23282a77b5b 100644 --- a/R/aaa-auto.R +++ b/R/aaa-auto.R @@ -2102,7 +2102,6 @@ is_bipartite_impl <- function(graph) { res } - bipartite_game_gnp_impl <- function(n1, n2, p, directed=FALSE, mode=c("all", "out", "in", "total")) { # Argument checks n1 <- as.numeric(n1) @@ -2114,7 +2113,7 @@ bipartite_game_gnp_impl <- function(n1, n2, p, directed=FALSE, mode=c("all", "ou on.exit( .Call(R_igraph_finalizer) ) # Function call res <- .Call(R_igraph_bipartite_game_gnp, n1, n2, p, directed, mode) - res <- set_vertex_attr(res$graph, "type", value = res$types) + res } @@ -2129,7 +2128,6 @@ bipartite_game_gnm_impl <- function(n1, n2, m, directed=FALSE, mode=c("all", "ou on.exit( .Call(R_igraph_finalizer) ) # Function call res <- .Call(R_igraph_bipartite_game_gnm, n1, n2, m, directed, mode) - res <- set_vertex_attr(res$graph, "type", value = res$types) res } diff --git a/R/games.R b/R/games.R index b5e19430187..25b7273b9f7 100644 --- a/R/games.R +++ b/R/games.R @@ -1864,11 +1864,13 @@ sample_bipartite_gnm <- function(n1, n2, m, directed = directed, mode = mode ) - res$name <- "Bipartite Gnm random graph" - res$m <- m - res + out <- set_vertex_attr(res$graph, "type", value = res$types) + + out$name <- "Bipartite Gnm random graph" + out$m <- m + out } #' @rdname sample_bipartite_gnm #' @export @@ -1888,11 +1890,12 @@ sample_bipartite_gnp <- function(n1, n2, p, mode = mode ) - res$name <- "Bipartite Gnp random graph" - res$p <- p + out <- set_vertex_attr(res$graph, "type", value = res$types) - res + out$name <- "Bipartite Gnp random graph" + out$p <- p + out } diff --git a/tools/stimulus/functions-R.yaml b/tools/stimulus/functions-R.yaml index 3217f0c78d6..bb3ec95f65a 100644 --- a/tools/stimulus/functions-R.yaml +++ b/tools/stimulus/functions-R.yaml @@ -754,10 +754,16 @@ igraph_is_bipartite: DEPS: type ON graph V(graph) igraph_bipartite_game_gnp: - DEPS: types ON graph V(graph) + PARAMS: |- + OUT GRAPH graph, OPTIONAL OUT BIPARTITE_TYPES_UNNAMED types, + INTEGER n1, INTEGER n2, REAL p, BOOLEAN directed=False, + NEIMODE mode=ALL igraph_bipartite_game_gnm: - DEPS: types ON graph V(graph) + PARAMS: |- + OUT GRAPH graph, OPTIONAL OUT BIPARTITE_TYPES_UNNAMED types, + INTEGER n1, INTEGER n2, INTEGER m, BOOLEAN directed=False, + NEIMODE mode=ALL igraph_bipartite_game: IGNORE: RR, RC diff --git a/tools/stimulus/types-RC.yaml b/tools/stimulus/types-RC.yaml index af5adf77635..95244bd425d 100644 --- a/tools/stimulus/types-RC.yaml +++ b/tools/stimulus/types-RC.yaml @@ -617,6 +617,20 @@ BIPARTITE_TYPES: igraph_vector_bool_destroy(&%C%); IGRAPH_FINALLY_CLEAN(1); +BIPARTITE_TYPES_UNNAMED: + CALL: + OUT: '&%C%' + CTYPE: igraph_vector_bool_t + INCONV: + OUT: |- + IGRAPH_R_CHECK(igraph_vector_bool_init(&%C%, 0)); + IGRAPH_FINALLY(igraph_vector_bool_destroy, &%C%); + OUTCONV: + OUT: |- + PROTECT(%I%=R_igraph_vector_bool_to_SEXP(&%C%)); + igraph_vector_bool_destroy(&%C%); + IGRAPH_FINALLY_CLEAN(1); + VERTEX_COLOR: CALL: IN: '&%C%' diff --git a/tools/stimulus/types-RR.yaml b/tools/stimulus/types-RR.yaml index d8091866f4a..cac0975df17 100644 --- a/tools/stimulus/types-RR.yaml +++ b/tools/stimulus/types-RR.yaml @@ -218,6 +218,8 @@ BIPARTITE_TYPES: names(%I%) <- vertex_attr(%I1%, "name", %I2%) } +BIPARTITE_TYPES_UNNAMED: + VERTEX_COLOR: INCONV: |- if (missing(%I%)) { From 55921c403bd14a8c90b3d3154719f34e719e3efd Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?Kirill=20M=C3=BCller?= Date: Thu, 20 Mar 2025 11:54:03 +0100 Subject: [PATCH 8/8] Adapt tests --- tests/testthat/test-bipartite.R | 2 +- tests/testthat/test-games.R | 22 ++++++++-------------- 2 files changed, 9 insertions(+), 15 deletions(-) diff --git a/tests/testthat/test-bipartite.R b/tests/testthat/test-bipartite.R index 1efe7ba3629..58d4b01df55 100644 --- a/tests/testthat/test-bipartite.R +++ b/tests/testthat/test-bipartite.R @@ -38,7 +38,7 @@ test_that("bipartite_projection works", { test_that("bipartite_projection can calculate only one projection", { withr::local_seed(42) - g <- sample_bipartite(5, 10, p = .3) + g <- sample_bipartite_gnp(5, 10, p = .3) proj <- bipartite_projection(g) proj_false <- bipartite_projection(g, which = "false") proj_true <- bipartite_projection(g, which = "true") diff --git a/tests/testthat/test-games.R b/tests/testthat/test-games.R index ff1f7e5e199..881f3abda26 100644 --- a/tests/testthat/test-games.R +++ b/tests/testthat/test-games.R @@ -327,7 +327,7 @@ test_that("sample_pa can start from a graph", { test_that("sample_bipartite works -- undirected gnp", { withr::local_seed(42) - g_rand_bip <- sample_bipartite(10, 5, type = "gnp", p = .1) + g_rand_bip <- sample_bipartite_gnp(10, 5, p = .1) expect_equal(g_rand_bip$name, "Bipartite Gnp random graph") expect_vcount(g_rand_bip, 15) expect_ecount(g_rand_bip, 7) @@ -336,49 +336,43 @@ test_that("sample_bipartite works -- undirected gnp", { }) test_that("sample_bipartite works -- directed gnp", { - g_rand_bip_dir <- sample_bipartite(10, 5, type = "gnp", p = .1, directed = TRUE) + g_rand_bip_dir <- sample_bipartite_gnp(10, 5, p = .1, directed = TRUE) expect_vcount(g_rand_bip_dir, 15) expect_ecount(g_rand_bip_dir, 6) expect_true(bipartite_mapping(g_rand_bip_dir)$res) expect_true(is_directed(g_rand_bip_dir)) expect_output(print_all(g_rand_bip_dir), "5->11") - g_rand_bip_in <- sample_bipartite(10, 5, type = "gnp", p = .1, directed = TRUE, mode = "in") + g_rand_bip_in <- sample_bipartite_gnp(10, 5, p = .1, directed = TRUE, mode = "in") expect_output(print_all(g_rand_bip_in), "11->3") }) test_that("sample_bipartite works -- undirected gnm", { - g_rand_bip_gnm <- sample_bipartite(10, 5, type = "gnm", m = 8) + g_rand_bip_gnm <- sample_bipartite_gnm(10, 5, m = 8) expect_vcount(g_rand_bip_gnm, 15) expect_ecount(g_rand_bip_gnm, 8) expect_true(bipartite_mapping(g_rand_bip_gnm)$res) expect_false(is_directed(g_rand_bip_gnm)) }) test_that("sample_bipartite works -- directed gnm", { - g_rand_bip_gnm_dir <- sample_bipartite(10, 5, type = "gnm", m = 8, directed = TRUE) + g_rand_bip_gnm_dir <- sample_bipartite_gnm(10, 5, m = 8, directed = TRUE) expect_vcount(g_rand_bip_gnm_dir, 15) expect_ecount(g_rand_bip_gnm_dir, 8) expect_true(bipartite_mapping(g_rand_bip_gnm_dir)$res) expect_true(is_directed(g_rand_bip_gnm_dir)) expect_output(print_all(g_rand_bip_gnm_dir), "5->12") - g_rand_bip_gnm_in <- sample_bipartite(10, 5, type = "gnm", m = 8, directed = TRUE, mode = "in") + g_rand_bip_gnm_in <- sample_bipartite_gnm(10, 5, m = 8, directed = TRUE, mode = "in") expect_vcount(g_rand_bip_gnm_in, 15) expect_ecount(g_rand_bip_gnm_in, 8) expect_true(bipartite_mapping(g_rand_bip_gnm_in)$res) expect_true(is_directed(g_rand_bip_gnm_in)) expect_output(print_all(g_rand_bip_gnm_in), "12->10") - g_rand_bip_full <- sample_bipartite(10, 5, - type = "gnp", p = 0.9999, directed = TRUE, - mode = "all" - ) + g_rand_bip_full <- sample_bipartite_gnp(10, 5, p = 0.9999, directed = TRUE, mode = "all") expect_ecount(g_rand_bip_full, 100) - g_rand_bip_edges <- sample_bipartite(10, 5, - type = "gnm", m = 99, directed = TRUE, - mode = "all" - ) + g_rand_bip_edges <- sample_bipartite_gnm(10, 5, m = 99, directed = TRUE, mode = "all") expect_ecount(g_rand_bip_edges, 99) })