|
671 | 671 | # realize_degree_sequence_impl errors |
672 | 672 |
|
673 | 673 | Code |
674 | | - realize_degree_sequence_impl(out_deg = -1) |
| 674 | + realize_degree_sequence_impl(out.deg = -1) |
675 | 675 | Condition |
676 | 676 | Error in `realize_degree_sequence_impl()`: |
677 | 677 | ! At vendor/cigraph/src/misc/degree_sequence.cpp:xx : The sum of degrees must be even for an undirected graph. Invalid value |
|
882 | 882 | # preference_game_impl errors |
883 | 883 |
|
884 | 884 | Code |
885 | | - preference_game_impl(nodes = -1, types = 2, type_dist = c(0.5, 0.5), |
886 | | - fixed_sizes = FALSE, pref_matrix = matrix(c(0.5, 0.5, 0.5, 0.5), 2, 2)) |
| 885 | + preference_game_impl(nodes = -1, types = 2, type.dist = c(0.5, 0.5), |
| 886 | + fixed.sizes = FALSE, pref.matrix = matrix(c(0.5, 0.5, 0.5, 0.5), 2, 2)) |
887 | 887 | Condition |
888 | 888 | Error in `preference_game_impl()`: |
889 | 889 | ! At vendor/cigraph/src/games/preference.c:xx : The number of vertices must be non-negative. Invalid value |
|
910 | 910 | # asymmetric_preference_game_impl errors |
911 | 911 |
|
912 | 912 | Code |
913 | | - asymmetric_preference_game_impl(nodes = -1, out_types = 2, in_types = 2, |
914 | | - type_dist_matrix = matrix(c(0.5, 0.5, 0.5, 0.5), 2, 2), pref_matrix = matrix( |
| 913 | + asymmetric_preference_game_impl(nodes = -1, out.types = 2, in.types = 2, |
| 914 | + type.dist.matrix = matrix(c(0.5, 0.5, 0.5, 0.5), 2, 2), pref.matrix = matrix( |
915 | 915 | c(0.5, 0.5, 0.5, 0.5), 2, 2)) |
916 | 916 | Condition |
917 | 917 | Error in `asymmetric_preference_game_impl()`: |
|
975 | 975 | # forest_fire_game_impl errors |
976 | 976 |
|
977 | 977 | Code |
978 | | - forest_fire_game_impl(nodes = -1, fw_prob = 0.5) |
| 978 | + forest_fire_game_impl(nodes = -1, fw.prob = 0.5) |
979 | 979 | Condition |
980 | 980 | Error in `forest_fire_game_impl()`: |
981 | 981 | ! At vendor/cigraph/src/games/forestfire.c:xx : Insufficient memory for forest fire model. Out of memory |
|
995 | 995 | # simple_interconnected_islands_game_impl errors |
996 | 996 |
|
997 | 997 | Code |
998 | | - simple_interconnected_islands_game_impl(islands_n = -1, islands_size = 3, |
999 | | - islands_pin = 0.5, n_inter = 1) |
| 998 | + simple_interconnected_islands_game_impl(islands.n = -1, islands.size = 3, |
| 999 | + islands.pin = 0.5, n.inter = 1) |
1000 | 1000 | Condition |
1001 | 1001 | Error in `simple_interconnected_islands_game_impl()`: |
1002 | 1002 | ! At vendor/cigraph/src/games/islands.c:xx : Number of islands cannot be negative, got -1. Invalid value |
|
1025 | 1025 | # chung_lu_game_impl errors |
1026 | 1026 |
|
1027 | 1027 | Code |
1028 | | - chung_lu_game_impl(out_weights = -1) |
| 1028 | + chung_lu_game_impl(out.weights = -1) |
1029 | 1029 | Condition |
1030 | 1030 | Error in `chung_lu_game_impl()`: |
1031 | 1031 | ! At vendor/cigraph/src/games/chung_lu.c:xx : Vertex weights must not be negative in Chung-Lu model, got -1. Invalid value |
|
1054 | 1054 | # static_fitness_game_impl errors |
1055 | 1055 |
|
1056 | 1056 | Code |
1057 | | - static_fitness_game_impl(no_of_edges = -1, fitness_out = c(1, 2, 3)) |
| 1057 | + static_fitness_game_impl(no.of.edges = -1, fitness.out = c(1, 2, 3)) |
1058 | 1058 | Condition |
1059 | 1059 | Error in `static_fitness_game_impl()`: |
1060 | 1060 | ! At vendor/cigraph/src/games/static_fitness.c:xx : Number of edges cannot be negative, got -1. Invalid value |
|
1085 | 1085 | # static_power_law_game_impl errors |
1086 | 1086 |
|
1087 | 1087 | Code |
1088 | | - static_power_law_game_impl(no_of_nodes = -1, no_of_edges = 4, exponent_out = 2.5) |
| 1088 | + static_power_law_game_impl(no.of.nodes = -1, no.of.edges = 4, exponent.out = 2.5) |
1089 | 1089 | Condition |
1090 | 1090 | Error in `static_power_law_game_impl()`: |
1091 | 1091 | ! At vendor/cigraph/src/games/static_fitness.c:xx : Number of nodes cannot be negative, got -1. Invalid value |
|
1113 | 1113 | # k_regular_game_impl errors |
1114 | 1114 |
|
1115 | 1115 | Code |
1116 | | - k_regular_game_impl(no_of_nodes = -1, k = 2) |
| 1116 | + k_regular_game_impl(no.of.nodes = -1, k = 2) |
1117 | 1117 | Condition |
1118 | 1118 | Error in `k_regular_game_impl()`: |
1119 | 1119 | ! At vendor/cigraph/src/games/k_regular.c:xx : Number of nodes must be non-negative. Invalid value |
|
1142 | 1142 | # sbm_game_impl errors |
1143 | 1143 |
|
1144 | 1144 | Code |
1145 | | - sbm_game_impl(n = -1, pref_matrix = matrix(0.5, 2, 2), block_sizes = c(2, 3)) |
| 1145 | + sbm_game_impl(n = -1, pref.matrix = matrix(0.5, 2, 2), block.sizes = c(2, 3)) |
1146 | 1146 | Condition |
1147 | 1147 | Error in `sbm_game_impl()`: |
1148 | 1148 | ! At vendor/cigraph/src/games/sbm.c:xx : Sum of the block sizes (5) must equal the number of vertices (-1). Invalid value |
|
1206 | 1206 | # correlated_game_impl errors |
1207 | 1207 |
|
1208 | 1208 | Code |
1209 | | - correlated_game_impl(old_graph = NULL, corr = 0.5) |
| 1209 | + correlated_game_impl(old.graph = NULL, corr = 0.5) |
1210 | 1210 | Condition |
1211 | 1211 | Error in `ensure_igraph()`: |
1212 | 1212 | ! Must provide a graph object (provided `NULL`). |
|
1988 | 1988 | # personalized_pagerank_vs_impl errors |
1989 | 1989 |
|
1990 | 1990 | Code |
1991 | | - personalized_pagerank_vs_impl(graph = NULL, reset_vids = 1) |
| 1991 | + personalized_pagerank_vs_impl(graph = NULL, reset.vids = 1) |
1992 | 1992 | Condition |
1993 | 1993 | Error in `ensure_igraph()`: |
1994 | 1994 | ! Must provide a graph object (provided `NULL`). |
|
2985 | 2985 | # rich_club_sequence_impl errors |
2986 | 2986 |
|
2987 | 2987 | Code |
2988 | | - rich_club_sequence_impl(graph = NULL, vertex_order = 1:3) |
| 2988 | + rich_club_sequence_impl(graph = NULL, vertex.order = 1:3) |
2989 | 2989 | Condition |
2990 | 2990 | Error in `ensure_igraph()`: |
2991 | 2991 | ! Must provide a graph object (provided `NULL`). |
|
3551 | 3551 | # joint_type_distribution_impl errors |
3552 | 3552 |
|
3553 | 3553 | Code |
3554 | | - joint_type_distribution_impl(graph = NULL, from_types = c(1, 2, 1)) |
| 3554 | + joint_type_distribution_impl(graph = NULL, from.types = c(1, 2, 1)) |
3555 | 3555 | Condition |
3556 | 3556 | Error in `ensure_igraph()`: |
3557 | 3557 | ! Must provide a graph object (provided `NULL`). |
|
3674 | 3674 | # pseudo_diameter_impl errors |
3675 | 3675 |
|
3676 | 3676 | Code |
3677 | | - pseudo_diameter_impl(graph = NULL, start_vid = 1) |
| 3677 | + pseudo_diameter_impl(graph = NULL, start.vid = 1) |
3678 | 3678 | Condition |
3679 | 3679 | Error in `ensure_igraph()`: |
3680 | 3680 | ! Must provide a graph object (provided `NULL`). |
|
3713 | 3713 | # pseudo_diameter_dijkstra_impl errors |
3714 | 3714 |
|
3715 | 3715 | Code |
3716 | | - pseudo_diameter_dijkstra_impl(graph = NULL, start_vid = 1) |
| 3716 | + pseudo_diameter_dijkstra_impl(graph = NULL, start.vid = 1) |
3717 | 3717 | Condition |
3718 | 3718 | Error in `ensure_igraph()`: |
3719 | 3719 | ! Must provide a graph object (provided `NULL`). |
|
3902 | 3902 | # is_graphical_impl errors |
3903 | 3903 |
|
3904 | 3904 | Code |
3905 | | - is_graphical_impl(out_deg = "a") |
| 3905 | + is_graphical_impl(out.deg = "a") |
3906 | 3906 | Condition |
3907 | 3907 | Warning in `is_graphical_impl()`: |
3908 | 3908 | NAs introduced by coercion |
|
5410 | 5410 | # community_fluid_communities_impl errors |
5411 | 5411 |
|
5412 | 5412 | Code |
5413 | | - community_fluid_communities_impl(graph = NULL, no_of_communities = 2) |
| 5413 | + community_fluid_communities_impl(graph = NULL, no.of.communities = 2) |
5414 | 5414 | Condition |
5415 | 5415 | Error in `ensure_igraph()`: |
5416 | 5416 | ! Must provide a graph object (provided `NULL`). |
|
5710 | 5710 | # hrg_sample_many_impl errors |
5711 | 5711 |
|
5712 | 5712 | Code |
5713 | | - hrg_sample_many_impl(hrg = NULL, num_samples = 2) |
| 5713 | + hrg_sample_many_impl(hrg = NULL, num.samples = 2) |
5714 | 5714 | Condition |
5715 | 5715 | Error in `hrg_sample_many_impl()`: |
5716 | 5716 | ! At vendor/cigraph/src/hrg/hrg_types.cc:xx : Assertion failed: n >= 0. This is an unexpected igraph error; please report this as a bug, along with the steps to reproduce it. |
|
6066 | 6066 | # motifs_randesu_estimate_impl errors |
6067 | 6067 |
|
6068 | 6068 | Code |
6069 | | - motifs_randesu_estimate_impl(graph = NULL, size = 3, sample_size = 2) |
| 6069 | + motifs_randesu_estimate_impl(graph = NULL, size = 3, sample.size = 2) |
6070 | 6070 | Condition |
6071 | 6071 | Error in `ensure_igraph()`: |
6072 | 6072 | ! Must provide a graph object (provided `NULL`). |
|
6088 | 6088 | # motifs_randesu_no_impl errors |
6089 | 6089 |
|
6090 | 6090 | Code |
6091 | | - motifs_randesu_no_impl(graph = g, size = 3, cut_prob = c(0.1)) |
| 6091 | + motifs_randesu_no_impl(graph = g, size = 3, cut.prob = c(0.1)) |
6092 | 6092 | Condition |
6093 | 6093 | Error in `motifs_randesu_no_impl()`: |
6094 | 6094 | ! At vendor/cigraph/src/misc/motifs.c:xx : Cut probability vector size (1) must agree with motif size (3). Invalid value |
|
6210 | 6210 | # local_scan_0_them_impl errors |
6211 | 6211 |
|
6212 | 6212 | Code |
6213 | | - local_scan_0_them_impl(us = NULL, them = them) |
| 6213 | + local_scan_0_them_impl(us = NULL, them = path_graph_impl(3)) |
6214 | 6214 | Condition |
6215 | 6215 | Error in `ensure_igraph()`: |
6216 | 6216 | ! Must provide a graph object (provided `NULL`). |
|
6254 | 6254 | # local_scan_1_ecount_them_impl errors |
6255 | 6255 |
|
6256 | 6256 | Code |
6257 | | - local_scan_1_ecount_them_impl(us = NULL, them = them) |
| 6257 | + local_scan_1_ecount_them_impl(us = NULL, them = path_graph_impl(3)) |
6258 | 6258 | Condition |
6259 | 6259 | Error in `ensure_igraph()`: |
6260 | 6260 | ! Must provide a graph object (provided `NULL`). |
|
6299 | 6299 | # local_scan_k_ecount_them_impl errors |
6300 | 6300 |
|
6301 | 6301 | Code |
6302 | | - local_scan_k_ecount_them_impl(us = NULL, them = them, k = 1) |
| 6302 | + local_scan_k_ecount_them_impl(us = NULL, them = path_graph_impl(3), k = 1) |
6303 | 6303 | Condition |
6304 | 6304 | Error in `ensure_igraph()`: |
6305 | 6305 | ! Must provide a graph object (provided `NULL`). |
|
6378 | 6378 | # join_impl errors |
6379 | 6379 |
|
6380 | 6380 | Code |
6381 | | - join_impl(left = NULL, right = right) |
| 6381 | + join_impl(left = NULL, right = path_graph_impl(3)) |
6382 | 6382 | Condition |
6383 | 6383 | Error in `ensure_igraph()`: |
6384 | 6384 | ! Must provide a graph object (provided `NULL`). |
|
6475 | 6475 | # product_impl errors |
6476 | 6476 |
|
6477 | 6477 | Code |
6478 | | - product_impl(g1 = NULL, g2 = g2) |
| 6478 | + product_impl(g1 = NULL, g2 = path_graph_impl(3)) |
6479 | 6479 | Condition |
6480 | 6480 | Error in `ensure_igraph()`: |
6481 | 6481 | ! Must provide a graph object (provided `NULL`). |
|
6492 | 6492 | # rooted_product_impl errors |
6493 | 6493 |
|
6494 | 6494 | Code |
6495 | | - rooted_product_impl(g1 = NULL, g2 = g2, root = 1) |
| 6495 | + rooted_product_impl(g1 = NULL, g2 = path_graph_impl(3), root = 1) |
6496 | 6496 | Condition |
6497 | 6497 | Error in `ensure_igraph()`: |
6498 | 6498 | ! Must provide a graph object (provided `NULL`). |
|
6958 | 6958 | # isomorphic_impl errors |
6959 | 6959 |
|
6960 | 6960 | Code |
6961 | | - isomorphic_impl(graph1 = NULL, graph2 = graph2) |
| 6961 | + isomorphic_impl(graph1 = NULL, graph2 = path_graph_impl(3)) |
6962 | 6962 | Condition |
6963 | 6963 | Error in `ensure_igraph()`: |
6964 | 6964 | ! Must provide a graph object (provided `NULL`). |
|
7040 | 7040 | # isomorphic_vf2_impl errors |
7041 | 7041 |
|
7042 | 7042 | Code |
7043 | | - isomorphic_vf2_impl(graph1 = NULL, graph2 = graph2) |
| 7043 | + isomorphic_vf2_impl(graph1 = NULL, graph2 = path_graph_impl(3)) |
7044 | 7044 | Condition |
7045 | 7045 | Error in `ensure_igraph()`: |
7046 | 7046 | ! Must provide a graph object (provided `NULL`). |
|
7093 | 7093 | # get_isomorphisms_vf2_impl errors |
7094 | 7094 |
|
7095 | 7095 | Code |
7096 | | - get_isomorphisms_vf2_impl(graph1 = NULL, graph2 = graph2) |
| 7096 | + get_isomorphisms_vf2_impl(graph1 = NULL, graph2 = path_graph_impl(3)) |
7097 | 7097 | Condition |
7098 | 7098 | Error in `ensure_igraph()`: |
7099 | 7099 | ! Must provide a graph object (provided `NULL`). |
|
7108 | 7108 | # subisomorphic_impl errors |
7109 | 7109 |
|
7110 | 7110 | Code |
7111 | | - subisomorphic_impl(graph1 = NULL, graph2 = graph2) |
| 7111 | + subisomorphic_impl(graph1 = NULL, graph2 = path_graph_impl(3)) |
7112 | 7112 | Condition |
7113 | 7113 | Error in `ensure_igraph()`: |
7114 | 7114 | ! Must provide a graph object (provided `NULL`). |
|
7147 | 7147 | # subisomorphic_vf2_impl errors |
7148 | 7148 |
|
7149 | 7149 | Code |
7150 | | - subisomorphic_vf2_impl(graph1 = NULL, graph2 = graph2) |
| 7150 | + subisomorphic_vf2_impl(graph1 = NULL, graph2 = path_graph_impl(3)) |
7151 | 7151 | Condition |
7152 | 7152 | Error in `ensure_igraph()`: |
7153 | 7153 | ! Must provide a graph object (provided `NULL`). |
|
7170 | 7170 | # count_subisomorphisms_vf2_impl errors |
7171 | 7171 |
|
7172 | 7172 | Code |
7173 | | - count_subisomorphisms_vf2_impl(graph1 = NULL, graph2 = graph2) |
| 7173 | + count_subisomorphisms_vf2_impl(graph1 = NULL, graph2 = path_graph_impl(3)) |
7174 | 7174 | Condition |
7175 | 7175 | Error in `ensure_igraph()`: |
7176 | 7176 | ! Must provide a graph object (provided `NULL`). |
|
7200 | 7200 | # get_subisomorphisms_vf2_impl errors |
7201 | 7201 |
|
7202 | 7202 | Code |
7203 | | - get_subisomorphisms_vf2_impl(graph1 = NULL, graph2 = graph2) |
| 7203 | + get_subisomorphisms_vf2_impl(graph1 = NULL, graph2 = path_graph_impl(3)) |
7204 | 7204 | Condition |
7205 | 7205 | Error in `ensure_igraph()`: |
7206 | 7206 | ! Must provide a graph object (provided `NULL`). |
|
7402 | 7402 | # isomorphic_bliss_impl errors |
7403 | 7403 |
|
7404 | 7404 | Code |
7405 | | - isomorphic_bliss_impl(graph1 = NULL, graph2 = graph2) |
| 7405 | + isomorphic_bliss_impl(graph1 = NULL, graph2 = path_graph_impl(3)) |
7406 | 7406 | Condition |
7407 | 7407 | Error in `ensure_igraph()`: |
7408 | 7408 | ! Must provide a graph object (provided `NULL`). |
|
10060 | 10060 | # roulette_wheel_imitation_impl errors |
10061 | 10061 |
|
10062 | 10062 | Code |
10063 | | - roulette_wheel_imitation_impl(graph = NULL, vid = 1, is_local = TRUE, |
| 10063 | + roulette_wheel_imitation_impl(graph = NULL, vid = 1, is.local = TRUE, |
10064 | 10064 | quantities = c(1, 2, 3), strategies = c(1, 2, 3)) |
10065 | 10065 | Condition |
10066 | 10066 | Error in `ensure_igraph()`: |
|
10127 | 10127 | # vertex_path_from_edge_path_impl errors |
10128 | 10128 |
|
10129 | 10129 | Code |
10130 | | - vertex_path_from_edge_path_impl(graph = NULL, start = 1, edge_path = c(1, 2)) |
| 10130 | + vertex_path_from_edge_path_impl(graph = NULL, start = 1, edge.path = c(1, 2)) |
10131 | 10131 | Condition |
10132 | 10132 | Error in `ensure_igraph()`: |
10133 | 10133 | ! Must provide a graph object (provided `NULL`). |
|
0 commit comments