From c54f2650178beeef69c07cf5599d7ab458291798 Mon Sep 17 00:00:00 2001 From: krlmlr <1741643+krlmlr@users.noreply.github.com> Date: Sun, 2 Nov 2025 15:13:24 +0000 Subject: [PATCH] [create-pull-request] automated change --- tests/testthat/_snaps/aaa-auto.md | 940 ++---------------------------- tests/testthat/_snaps/flow.md | 9 +- 2 files changed, 60 insertions(+), 889 deletions(-) diff --git a/tests/testthat/_snaps/aaa-auto.md b/tests/testthat/_snaps/aaa-auto.md index 9942e6eecc8..de910e770c6 100644 --- a/tests/testthat/_snaps/aaa-auto.md +++ b/tests/testthat/_snaps/aaa-auto.md @@ -611,7 +611,7 @@ + attr: name (g/c), out_deg (g/n), in_deg (g/x), allowed_edge_types | (g/n), method (g/n) + edges: - [1] 1--3 2--3 1--2 + [1] 2--3 1--3 1--2 --- @@ -669,8 +669,7 @@ Code circulant_impl(n = 5, shifts = c(1, 2)) Output - IGRAPH U--- 5 10 -- Circulant graph - + attr: name (g/c), shifts (g/n) + IGRAPH U--- 5 10 -- + edges: [1] 1--2 2--3 3--4 4--5 1--5 1--3 2--4 3--5 1--4 2--5 @@ -679,8 +678,7 @@ Code circulant_impl(n = 5, shifts = c(1, 2), directed = TRUE) Output - IGRAPH D--- 5 10 -- Circulant graph - + attr: name (g/c), shifts (g/n) + IGRAPH D--- 5 10 -- + edges: [1] 1->2 2->3 3->4 4->5 5->1 1->3 2->4 3->5 4->1 5->2 @@ -750,15 +748,6 @@ + edges: [1] 1--2 1--3 2--3 1--4 2--4 1--5 4--5 ---- - - Code - erdos_renyi_game_gnp_impl(n = 5, p = 0.5, directed = TRUE, loops = TRUE) - Output - IGRAPH D--- 5 12 -- - + edges: - [1] 2->1 3->1 4->1 2->2 1->3 2->3 4->3 1->4 2->4 5->4 3->5 4->5 - # erdos_renyi_game_gnp_impl errors Code @@ -776,15 +765,6 @@ + edges: [1] 3--4 2--5 4--5 ---- - - Code - erdos_renyi_game_gnm_impl(n = 5, m = 3, directed = TRUE, loops = TRUE) - Output - IGRAPH D--- 5 3 -- - + edges: - [1] 4->3 5->3 3->5 - # erdos_renyi_game_gnm_impl errors Code @@ -944,8 +924,8 @@ islands_pin = 0.5, n_inter = 1) Output IGRAPH U--- 6 6 -- Interconnected islands model - + attr: name (g/c), islands.n (g/n), islands.size (g/n), islands.pin - | (g/n), n.inter (g/n) + + attr: name (g/c), islands_n (g/n), islands_size (g/n), islands_pin + | (g/n), n_inter (g/n) + edges: [1] 1--2 1--3 2--3 2--6 4--5 4--6 @@ -987,27 +967,6 @@ Error in `chung_lu_game_impl()`: ! At vendor/cigraph/src/games/chung_lu.c:xx : Vertex weights must not be negative in Chung-Lu model, got -1. Invalid value -# static_fitness_game_impl basic - - Code - static_fitness_game_impl(no_of_edges = 3, fitness_out = c(1, 2, 3)) - Output - IGRAPH U--- 3 3 -- Static fitness model - + attr: name (g/c), loops (g/l), multiple (g/l) - + edges: - [1] 1--2 1--3 2--3 - ---- - - Code - static_fitness_game_impl(no_of_edges = 3, fitness_out = c(1, 2, 3), fitness_in = c( - 1, 2, 3), loops = TRUE, multiple = TRUE) - Output - IGRAPH D--- 3 3 -- Static fitness model - + attr: name (g/c), loops (g/l), multiple (g/l) - + edges: - [1] 1->2 2->3 1->3 - # static_fitness_game_impl errors Code @@ -1022,23 +981,11 @@ static_power_law_game_impl(no_of_nodes = 5, no_of_edges = 4, exponent_out = 2.5) Output IGRAPH U--- 5 4 -- Static power law model - + attr: name (g/c), exponent_out (g/n), exponent_in (g/n), loops (g/l), - | multiple (g/l), finite_size_correction (g/l) + + attr: name (g/c), exponent_out (g/n), exponent_in (g/n), + | finite_size_correction (g/l) + edges: [1] 1--5 2--4 3--5 4--5 ---- - - Code - static_power_law_game_impl(no_of_nodes = 5, no_of_edges = 4, exponent_out = 2.5, - exponent_in = 2, loops = TRUE, multiple = TRUE, finite_size_correction = FALSE) - Output - IGRAPH D--- 5 4 -- Static power law model - + attr: name (g/c), exponent_out (g/n), exponent_in (g/n), loops (g/l), - | multiple (g/l), finite_size_correction (g/l) - + edges: - [1] 1->1 3->5 1->4 5->1 - # static_power_law_game_impl errors Code @@ -1075,27 +1022,6 @@ Error in `k_regular_game_impl()`: ! At vendor/cigraph/src/games/k_regular.c:xx : Number of nodes must be non-negative. Invalid value -# sbm_game_impl basic - - Code - sbm_game_impl(n = 5, pref_matrix = matrix(0.5, 2, 2), block_sizes = c(2, 3)) - Output - IGRAPH U--- 5 6 -- Stochastic block model - + attr: name (g/c), loops (g/l) - + edges: - [1] 1--2 1--3 2--3 1--4 1--5 3--5 - ---- - - Code - sbm_game_impl(n = 5, pref_matrix = matrix(0.5, 2, 2), block_sizes = c(2, 3), - directed = TRUE, loops = TRUE) - Output - IGRAPH D--- 5 14 -- Stochastic block model - + attr: name (g/c), loops (g/l) - + edges: - [1] 1->1 2->1 2->4 1->5 4->1 5->1 5->2 3->3 5->3 3->4 4->4 5->4 3->5 5->5 - # sbm_game_impl errors Code @@ -1150,16 +1076,6 @@ Error in `hsbm_list_game_impl()`: ! At vendor/cigraph/src/games/sbm.c:xx : `n' must be positive for HSBM. Invalid value -# correlated_game_impl basic - - Code - correlated_game_impl(old_graph = g, corr = 0.5) - Output - IGRAPH U--- 5 3 -- Correlated random graph - + attr: name (g/c), corr (g/n), p (g/n) - + edges: - [1] 1--3 3--4 2--5 - # correlated_game_impl errors Code @@ -1404,14 +1320,12 @@ Output $vpaths $vpaths[[1]] - + 3/3 vertices: [1] 1 2 3 $epaths $epaths[[1]] - + 2/2 edges: - [1] 1--2 2--3 + [1] 1 2 $nrgeo @@ -1433,14 +1347,12 @@ Output $vpaths $vpaths[[1]] - + 3/3 vertices: [1] 1 2 3 $epaths $epaths[[1]] - + 2/2 edges: - [1] 1--2 2--3 + [1] 1 2 $nrgeo @@ -1487,14 +1399,6 @@ Error in `ensure_igraph()`: ! Must provide a graph object (provided `NULL`). -# get_all_simple_paths_impl basic - - Code - get_all_simple_paths_impl(graph = g, from = 1, to = 3) - Output - + 3/3 vertices: - [1] 1 2 3 - # get_all_simple_paths_impl errors Code @@ -1510,14 +1414,12 @@ Output $vpaths $vpaths[[1]] - + 3/3 vertices: [1] 1 2 3 $epaths $epaths[[1]] - + 2/2 edges: - [1] 1--2 2--3 + [1] 1 2 @@ -1558,14 +1460,12 @@ Output $vertices $vertices[[1]] - + 3/3 vertices: [1] 1 2 3 $edges $edges[[1]] - + 2/2 edges: - [1] 1--2 2--3 + [1] 1 2 $parents @@ -1793,81 +1693,6 @@ Output [1] 0.3452703 0.4594595 0.1952703 ---- - - Code - personalized_pagerank_vs_impl(graph = g, reset.vids = 1, algo = "arpack", - details = TRUE) - Output - $vector - [1] 0.3452703 0.4594595 0.1952703 - - $value - [1] 1 - - $options - $options$bmat - [1] "I" - - $options$n - [1] 3 - - $options$which - [1] "LR" - - $options$nev - [1] 1 - - $options$tol - [1] 0 - - $options$ncv - [1] 0 - - $options$ldv - [1] 0 - - $options$ishift - [1] 1 - - $options$maxiter - [1] 3000 - - $options$nb - [1] 1 - - $options$mode - [1] 1 - - $options$start - [1] 1 - - $options$sigma - [1] 0 - - $options$sigmai - [1] 0 - - $options$info - [1] 0 - - $options$iter - [1] 1 - - $options$nconv - [1] 1 - - $options$numop - [1] 3 - - $options$numopb - [1] 0 - - $options$numreo - [1] 3 - - - # personalized_pagerank_vs_impl errors Code @@ -2537,10 +2362,10 @@ Code suppressWarnings(hub_and_authority_scores_impl(graph = g)) Output - $hub + $hub_vector [1] 1 1 1 1 1 - $authority + $authority_vector [1] 1 1 1 1 1 $value @@ -2867,7 +2692,7 @@ [1] 2 $theoretical_max - [1] 2 + [1] 6 # centralization_degree_impl errors @@ -3000,86 +2825,6 @@ # centralization_eigenvector_centrality_impl basic - Code - centralization_eigenvector_centrality_impl(graph = g) - Output - $vector - [1] 0.7071068 1.0000000 0.7071068 - - $value - [1] 1.414214 - - $options - $options$bmat - [1] "I" - - $options$n - [1] 3 - - $options$which - [1] "LA" - - $options$nev - [1] 1 - - $options$tol - [1] 0 - - $options$ncv - [1] 0 - - $options$ldv - [1] 0 - - $options$ishift - [1] 1 - - $options$maxiter - [1] 3000 - - $options$nb - [1] 1 - - $options$mode - [1] 1 - - $options$start - [1] 1 - - $options$sigma - [1] 0 - - $options$sigmai - [1] 0 - - $options$info - [1] 0 - - $options$iter - [1] 1 - - $options$nconv - [1] 1 - - $options$numop - [1] 3 - - $options$numopb - [1] 0 - - $options$numreo - [1] 3 - - - $centralization - [1] 0.5857864 - - $theoretical_max - [1] 1 - - ---- - Code centralization_eigenvector_centrality_impl(graph = g, mode = "out", normalized = FALSE) Output @@ -3256,24 +3001,6 @@ Error in `ensure_igraph()`: ! Must provide a graph object (provided `NULL`). -# joint_degree_matrix_impl basic - - Code - joint_degree_matrix_impl(graph = g) - Output - [,1] [,2] - [1,] 0 2 - [2,] 2 0 - ---- - - Code - joint_degree_matrix_impl(graph = g, max_out_degree = 2, max_in_degree = 2) - Output - [,1] [,2] - [1,] 0 2 - [2,] 2 0 - # joint_degree_matrix_impl errors Code @@ -3282,28 +3009,6 @@ Error in `ensure_igraph()`: ! Must provide a graph object (provided `NULL`). -# joint_degree_distribution_impl basic - - Code - joint_degree_distribution_impl(graph = g) - Output - [,1] [,2] [,3] - [1,] 0 0.0 0.0 - [2,] 0 0.0 0.5 - [3,] 0 0.5 0.0 - ---- - - Code - joint_degree_distribution_impl(graph = g, from_mode = "in", to_mode = "out", - directed_neighbors = FALSE, normalized = FALSE, max_from_degree = 2, - max_to_degree = 2) - Output - [,1] [,2] [,3] - [1,] 0 0 0 - [2,] 0 0 2 - [3,] 0 2 0 - # joint_degree_distribution_impl errors Code @@ -3665,7 +3370,7 @@ # biadjacency_impl errors Code - biadjacency_impl(incidence = "a") + biadjacency_impl(biadjmatrix = "a") Condition Warning in `biadjacency_impl()`: NAs introduced by coercion @@ -3950,31 +3655,25 @@ $tree_edges $tree_edges[[1]] - + 1/2 edge: - [1] 2--3 + [1] 2 $tree_edges[[2]] - + 1/2 edge: - [1] 1--2 + [1] 1 $component_edges $component_edges[[1]] - + 1/2 edge: - [1] 2--3 + [1] 2 $component_edges[[2]] - + 1/2 edge: - [1] 1--2 + [1] 1 $components $components[[1]] - + 2/3 vertices: [1] 3 2 $components[[2]] - + 2/3 vertices: [1] 2 1 @@ -4126,46 +3825,6 @@ Error in `ensure_igraph()`: ! Must provide a graph object (provided `NULL`). -# cliques_impl basic - - Code - cliques_impl(graph = g) - Output - [[1]] - + 1/3 vertex: - [1] 2 - - [[2]] - + 1/3 vertex: - [1] 3 - - [[3]] - + 2/3 vertices: - [1] 2 3 - - [[4]] - + 1/3 vertex: - [1] 1 - - [[5]] - + 2/3 vertices: - [1] 1 2 - - ---- - - Code - cliques_impl(graph = g, min = 2, max = 2) - Output - [[1]] - + 2/3 vertices: - [1] 2 3 - - [[2]] - + 2/3 vertices: - [1] 1 2 - - # cliques_impl errors Code @@ -4202,11 +3861,9 @@ largest_cliques_impl(graph = g) Output [[1]] - + 2/3 vertices: [1] 1 2 [[2]] - + 2/3 vertices: [1] 2 3 @@ -4255,43 +3912,6 @@ Error in `ensure_igraph()`: ! Must provide a graph object (provided `NULL`). -# weighted_cliques_impl basic - - Code - weighted_cliques_impl(graph = g) - Output - [[1]] - + 1/3 vertex: - [1] 2 - - [[2]] - + 1/3 vertex: - [1] 3 - - [[3]] - + 2/3 vertices: - [1] 2 3 - - [[4]] - + 1/3 vertex: - [1] 1 - - [[5]] - + 2/3 vertices: - [1] 1 2 - - ---- - - Code - weighted_cliques_impl(graph = g, vertex_weights = c(1, 2, 3), min_weight = 1, - max_weight = 3, maximal = TRUE) - Output - [[1]] - + 2/3 vertices: - [1] 1 2 - - # weighted_cliques_impl errors Code @@ -4306,11 +3926,9 @@ largest_weighted_cliques_impl(graph = g) Output [[1]] - + 2/3 vertices: [1] 1 2 [[2]] - + 2/3 vertices: [1] 2 3 @@ -4320,7 +3938,6 @@ largest_weighted_cliques_impl(graph = g, vertex_weights = c(1, 2, 3)) Output [[1]] - + 2/3 vertices: [1] 2 3 @@ -4562,13 +4179,13 @@ [2,] 0.5 0 [3,] 1.0 1 - $extd_graph - IGRAPH U--- 3 2 -- - + edges: - [1] 1--2 2--3 + $routing + $routing[[1]] + [,1] [,2] + + $routing[[2]] + [,1] [,2] - $extd_to_orig_eids - [1] 1 2 --- @@ -4583,13 +4200,13 @@ [2,] 0 2 [3,] 0 4 - $extd_graph - IGRAPH U--- 3 2 -- - + edges: - [1] 1--2 2--3 + $routing + $routing[[1]] + [,1] [,2] + + $routing[[2]] + [,1] [,2] - $extd_to_orig_eids - [1] 1 2 # layout_sugiyama_impl errors @@ -4663,9 +4280,9 @@ layout_gem_impl(graph = g, res = matrix(0, nrow = 3, ncol = 2)) Output [,1] [,2] - [1,] 200.18284 -69.23950 - [2,] 86.00346 64.12806 - [3,] 66.22930 -92.94294 + [1,] 198.00782 -89.56102 + [2,] 97.48628 69.81047 + [3,] 62.46741 -81.07358 --- @@ -4673,10 +4290,10 @@ layout_gem_impl(graph = g, res = matrix(0, nrow = 3, ncol = 2), use_seed = TRUE, maxiter = 10, temp_max = 2, temp_min = 0.1, temp_init = 1) Output - [,1] [,2] - [1,] 1.0114521 -0.1206363 - [2,] -0.2178589 2.9621162 - [3,] -0.7089555 -3.8896500 + [,1] [,2] + [1,] 2.957479289 -2.693158072 + [2,] -2.952570979 2.698577710 + [3,] -0.008515571 -0.009237893 # layout_gem_impl errors @@ -4691,10 +4308,10 @@ Code layout_davidson_harel_impl(graph = g, res = matrix(0, nrow = 3, ncol = 2)) Output - [,1] [,2] - [1,] 1.152116 0.9424808 - [2,] 2.474361 2.5195497 - [3,] 3.849187 4.0402661 + [,1] [,2] + [1,] 4.585389 0.5320103 + [2,] 3.619767 -1.3038597 + [3,] 2.715926 -3.1387678 --- @@ -4705,9 +4322,9 @@ weight_node_edge_dist = 0.3) Output [,1] [,2] - [1,] -6.609493 -2.155221 - [2,] -8.660255 -3.797365 - [3,] -6.485087 -5.224752 + [1,] 0.7466363 -2.423994 + [2,] 2.9971183 -2.558975 + [3,] 5.1781802 -3.072543 # layout_davidson_harel_impl errors @@ -4808,25 +4425,6 @@ Error in `ensure_igraph()`: ! Must provide a graph object (provided `NULL`). -# similarity_dice_impl basic - - Code - similarity_dice_impl(graph = g) - Output - [,1] [,2] [,3] - [1,] 1 0 1 - [2,] 0 1 0 - [3,] 1 0 1 - ---- - - Code - similarity_dice_impl(g, vit.from = 1:2, mode = "in", loops = TRUE) - Output - [,1] [,2] - [1,] 1.0 0.8 - [2,] 0.8 1.0 - # similarity_dice_impl errors Code @@ -4907,25 +4505,6 @@ Error in `ensure_igraph()`: ! Must provide a graph object (provided `NULL`). -# similarity_jaccard_impl basic - - Code - similarity_jaccard_impl(graph = g) - Output - [,1] [,2] [,3] - [1,] 1 0 1 - [2,] 0 1 0 - [3,] 1 0 1 - ---- - - Code - similarity_jaccard_impl(g, vit.from = 1:2, mode = "in", loops = TRUE) - Output - [,1] [,2] - [1,] 1.0000000 0.6666667 - [2,] 0.6666667 1.0000000 - # similarity_jaccard_impl errors Code @@ -5070,28 +4649,6 @@ Error in `ensure_igraph()`: ! Must provide a graph object (provided `NULL`). -# community_label_propagation_impl basic - - Code - community_label_propagation_impl(graph = g, lpa.variant = "dominance") - Output - [1] 0 0 0 - ---- - - Code - community_label_propagation_impl(graph = g) - Output - [1] 0 0 0 - ---- - - Code - community_label_propagation_impl(graph = g, mode = "in", weights = c(1, 2), - initial = 1:3, fixed = c(TRUE, FALSE, TRUE), lpa.variant = "retention") - Output - [1] 0 1 1 - # community_label_propagation_impl errors Code @@ -5172,23 +4729,6 @@ Error in `ensure_igraph()`: ! Must provide a graph object (provided `NULL`). -# community_leiden_impl basic - - Code - community_leiden_impl(graph = g, weights = c(1, 2), vertex.out.weights = c(1, 2, - 3), resolution = 0.5, beta = 0.1, start = TRUE, n.iterations = 1, membership = 1: - 3) - Output - $membership - [1] 0 1 2 - - $nb_clusters - [1] 3 - - $quality - [1] -1.166667 - - # community_leiden_impl errors Code @@ -5219,31 +4759,6 @@ Error in `split_join_distance_impl()`: ! At rinterface_extra.c:xx : The value nan is not representable as an integer. Invalid value -# community_infomap_impl basic - - Code - community_infomap_impl(graph = g) - Output - $membership - [1] 0 0 0 - - $codelength - [1] 1.512987 - - ---- - - Code - community_infomap_impl(graph = g, edge.weights = c(1, 2), vertex.weights = c(1, 2, 3), - nb.trials = 2) - Output - $membership - [1] 0 0 0 - - $codelength - [1] 1.462254 - - # community_infomap_impl errors Code @@ -5259,11 +4774,9 @@ Output $cliques $cliques[[1]] - + 2/3 vertices: [1] 2 3 $cliques[[2]] - + 2/3 vertices: [1] 1 2 @@ -5278,11 +4791,9 @@ Output $cliques $cliques[[1]] - + 2/3 vertices: [1] 2 3 $cliques[[2]] - + 2/3 vertices: [1] 1 2 @@ -6057,7 +5568,7 @@ [1] 1--2 $map - [1] 2 3 1 + [1] 1 2 0 $invmap [1] 1 2 @@ -6074,7 +5585,7 @@ [1] 1--2 $map - [1] 2 3 1 + [1] 1 2 0 $invmap [1] 1 2 @@ -6423,21 +5934,17 @@ Output $cuts $cuts[[1]] - + 1/2 edge: - [1] 1->2 + [1] 1 $cuts[[2]] - + 1/2 edge: - [1] 2->3 + [1] 2 $partition1s $partition1s[[1]] - + 1/3 vertex: [1] 1 $partition1s[[2]] - + 2/3 vertices: [1] 1 2 @@ -6460,21 +5967,17 @@ $cuts $cuts[[1]] - + 1/2 edge: - [1] 1->2 + [1] 1 $cuts[[2]] - + 1/2 edge: - [1] 2->3 + [1] 2 $partition1s $partition1s[[1]] - + 1/3 vertex: [1] 1 $partition1s[[2]] - + 2/3 vertices: [1] 1 2 @@ -6489,13 +5992,11 @@ $cuts $cuts[[1]] - + 1/2 edge: - [1] 1->2 + [1] 1 $partition1s $partition1s[[1]] - + 1/3 vertex: [1] 1 @@ -6566,7 +6067,6 @@ all_minimal_st_separators_impl(graph = g) Output [[1]] - + 1/3 vertex: [1] 2 @@ -6584,7 +6084,6 @@ minimum_size_separators_impl(graph = g) Output [[1]] - + 1/3 vertex: [1] 2 @@ -6873,58 +6372,14 @@ Code canonical_permutation_impl(graph = g) Output - $labeling - [1] 2 3 1 - - $info - $info$nof_nodes - [1] 3 - - $info$nof_leaf_nodes - [1] 3 - - $info$nof_bad_nodes - [1] 0 - - $info$nof_canupdates - [1] 1 - - $info$max_level - [1] 1 - - $info$group_size - [1] "2" - - + [1] 3 1 2 --- Code canonical_permutation_impl(graph = g, colors = c(1, 2, 3)) Output - $labeling [1] 1 2 3 - - $info - $info$nof_nodes - [1] 1 - - $info$nof_leaf_nodes - [1] 1 - - $info$nof_bad_nodes - [1] 0 - - $info$nof_canupdates - [1] 0 - - $info$max_level - [1] 0 - - $info$group_size - [1] "1" - - # canonical_permutation_impl errors @@ -7075,48 +6530,14 @@ Code count_automorphisms_impl(graph = g) Output - $nof_nodes - [1] 3 - - $nof_leaf_nodes - [1] 3 - - $nof_bad_nodes - [1] 0 - - $nof_canupdates - [1] 1 - - $max_level - [1] 1 - - $group_size - [1] "2" - + [1] 2 --- Code count_automorphisms_impl(graph = g, colors = c(1, 2, 3)) Output - $nof_nodes - [1] 1 - - $nof_leaf_nodes [1] 1 - - $nof_bad_nodes - [1] 0 - - $nof_canupdates - [1] 0 - - $max_level - [1] 0 - - $group_size - [1] "1" - # count_automorphisms_impl errors @@ -7131,39 +6552,7 @@ Code automorphism_group_impl(graph = g, colors = c(1, 2, 3)) Output - [[1]] - + 3/3 vertices: - [1] 3 2 1 - - ---- - - Code - automorphism_group_impl(g, colors = c(1, 2, 3)) - Output - $generators list() - - $info - $info$nof_nodes - [1] 1 - - $info$nof_leaf_nodes - [1] 1 - - $info$nof_bad_nodes - [1] 0 - - $info$nof_canupdates - [1] 0 - - $info$max_level - [1] 0 - - $info$group_size - [1] "1" - - # automorphism_group_impl errors @@ -7306,167 +6695,6 @@ Error in `ensure_igraph()`: ! Must provide a graph object (provided `NULL`). -# adjacency_spectral_embedding_impl basic - - Code - adjacency_spectral_embedding_impl(graph = g, no = 2) - Output - $X - [,1] [,2] - [1,] 0.6718598 -0.4487712 - [2,] 1.1328501 0.5323058 - [3,] 0.6718598 -0.4487712 - - $Y - NULL - - $D - [1] 2.1861407 -0.6861407 - - $options - $options$bmat - [1] "I" - - $options$n - [1] 3 - - $options$which - [1] "LM" - - $options$nev - [1] 2 - - $options$tol - [1] 0 - - $options$ncv - [1] 3 - - $options$ldv - [1] 0 - - $options$ishift - [1] 1 - - $options$maxiter - [1] 3000 - - $options$nb - [1] 1 - - $options$mode - [1] 1 - - $options$start - [1] 1 - - $options$sigma - [1] 0 - - $options$sigmai - [1] 0 - - $options$info - [1] 0 - - $options$iter - [1] 1 - - $options$nconv - [1] 2 - - $options$numop - [1] 3 - - $options$numopb - [1] 0 - - $options$numreo - [1] 2 - - - ---- - - Code - adjacency_spectral_embedding_impl(graph = g, no = 2, weights = c(1, 2), which = "la", - scaled = FALSE, cvec = c(1, 2, 3), options = list(maxiter = 10)) - Output - $X - [,1] [,2] - [1,] 0.1720265 -0.7864357 - [2,] 0.6311790 -0.3743620 - [3,] 0.7563200 0.4912963 - - $Y - NULL - - $D - [1] 4.669079 1.476024 - - $options - $options$bmat - [1] "I" - - $options$n - [1] 3 - - $options$which - [1] "LA" - - $options$nev - [1] 2 - - $options$tol - [1] 0 - - $options$ncv - [1] 3 - - $options$ldv - [1] 0 - - $options$ishift - [1] 1 - - $options$maxiter - [1] 10 - - $options$nb - [1] 1 - - $options$mode - [1] 1 - - $options$start - [1] 1 - - $options$sigma - [1] 0 - - $options$sigmai - [1] 0 - - $options$info - [1] 0 - - $options$iter - [1] 1 - - $options$nconv - [1] 2 - - $options$numop - [1] 3 - - $options$numopb - [1] 0 - - $options$numreo - [1] 2 - - - # adjacency_spectral_embedding_impl errors Code @@ -7482,9 +6710,9 @@ Output $X [,1] [,2] - [1,] -0.7071068 -0.7071068 + [1,] -0.7071068 0.7071068 [2,] 1.4142136 0.0000000 - [3,] -0.7071068 0.7071068 + [3,] -0.7071068 -0.7071068 $Y NULL @@ -7551,7 +6779,7 @@ [1] 0 $options$numreo - [1] 3 + [1] 2 @@ -9231,31 +8459,6 @@ Error in `ensure_igraph()`: ! Must provide a graph object (provided `NULL`). -# simple_cycles_impl basic - - Code - simple_cycles_impl(graph = g) - Output - $vertices - list() - - $edges - list() - - ---- - - Code - simple_cycles_impl(graph = g, mode = "in", min_cycle_length = 2, - max_cycle_length = 3) - Output - $vertices - list() - - $edges - list() - - # simple_cycles_impl errors Code @@ -9336,20 +8539,6 @@ Error in `ensure_igraph()`: ! Must provide a graph object (provided `NULL`). -# fundamental_cycles_impl basic - - Code - fundamental_cycles_impl(graph = g, start = 1) - Output - list() - ---- - - Code - fundamental_cycles_impl(graph = g, start = 1, bfs_cutoff = 2, weights = c(1, 2)) - Output - list() - # fundamental_cycles_impl errors Code @@ -9358,21 +8547,6 @@ Error in `ensure_igraph()`: ! Must provide a graph object (provided `NULL`). -# minimum_cycle_basis_impl basic - - Code - minimum_cycle_basis_impl(graph = g) - Output - list() - ---- - - Code - minimum_cycle_basis_impl(graph = g, bfs_cutoff = 2, complete = FALSE, - use_cycle_order = FALSE, weights = c(1, 2)) - Output - list() - # minimum_cycle_basis_impl errors Code diff --git a/tests/testthat/_snaps/flow.md b/tests/testthat/_snaps/flow.md index add2f35391b..d8535093377 100644 --- a/tests/testthat/_snaps/flow.md +++ b/tests/testthat/_snaps/flow.md @@ -102,15 +102,12 @@ min_st_separators(g_note) Output [[1]] - + 1/5 vertex, named, from something - [1] 1 + [1] 2 [[2]] - + 2/5 vertices, named, from something - [1] 2 4 + [1] 3 5 [[3]] - + 2/5 vertices, named, from something - [1] 1 3 + [1] 2 4