/dports/math/R-cran-igraph/igraph/src/ |
H A D | other.c | 120 igraph_integer_t no_of_nodes; in igraph_convex_hull() local 125 no_of_nodes = (igraph_integer_t) igraph_matrix_nrow(data); in igraph_convex_hull() 129 if (no_of_nodes == 0) { in igraph_convex_hull() 140 IGRAPH_VECTOR_INIT_FINALLY(&angles, no_of_nodes); in igraph_convex_hull() 144 for (i = 1; i < no_of_nodes; i++) { in igraph_convex_hull() 156 for (i = 0; i < no_of_nodes; i++) { in igraph_convex_hull() 169 IGRAPH_VECTOR_INIT_FINALLY(&order, no_of_nodes); in igraph_convex_hull() 176 pivot_idx = (long int) VECTOR(order)[no_of_nodes - 1]; in igraph_convex_hull() 177 for (i = 1; i < no_of_nodes; i++) { in igraph_convex_hull()
|
H A D | topology.c | 712 long int no_of_nodes = igraph_vcount(graph); in igraph_isoclass() local 719 if (no_of_nodes < 3 || no_of_nodes > 4) { in igraph_isoclass() 725 if (no_of_nodes == 3) { in igraph_isoclass() 735 if (no_of_nodes == 3) { in igraph_isoclass() 1158 if (no_of_nodes != igraph_vcount(graph2) || in igraph_isomorphic_function_vf2() 2818 for (i = 0; i < no_of_nodes; i++) { in igraph_permute_vertices() 2938 if (no_of_nodes != igraph_vcount(graph2) || in igraph_isomorphic_bliss() 2964 for (i = 0; i < no_of_nodes; i++) { in igraph_isomorphic_bliss() 2968 for (i = 0; i < no_of_nodes; i++) { in igraph_isomorphic_bliss() 3026 for (i = 0; i < no_of_nodes; i++) { in igraph_isomorphic_bliss() [all …]
|
H A D | walktrap.cpp | 126 long int no_of_nodes = (long int)igraph_vcount(graph); in igraph_community_walktrap() local 144 IGRAPH_CHECK(igraph_matrix_resize(merges, no_of_nodes - no, 2)); in igraph_community_walktrap() 147 IGRAPH_CHECK(igraph_vector_resize(modularity, no_of_nodes)); in igraph_community_walktrap() 161 IGRAPH_CHECK(igraph_community_to_membership(merges, no_of_nodes, in igraph_community_walktrap()
|
H A D | operators.c | 218 long int no_of_nodes; in igraph_i_merge() local 503 long int no_of_nodes = 0; in igraph_intersection_many() local 536 if (n > no_of_nodes) { in igraph_intersection_many() 537 no_of_nodes = n; in igraph_intersection_many() 766 long int no_of_nodes = 0; in igraph_union_many() local 799 if (n > no_of_nodes) { in igraph_union_many() 800 no_of_nodes = n; in igraph_union_many() 954 long int no_of_nodes = no_of_nodes_orig; in igraph_difference() local 1098 long int no_of_nodes = igraph_vcount(graph); in igraph_complementer() local 1113 for (i = 0; i < no_of_nodes; i++) { in igraph_complementer() [all …]
|
H A D | sir.c | 116 int no_of_nodes = igraph_vcount(graph); in igraph_sir() local 124 if (no_of_nodes == 0) { in igraph_sir() 146 IGRAPH_CHECK(igraph_vector_int_init(&status, no_of_nodes)); in igraph_sir() 150 IGRAPH_CHECK(igraph_psumtree_init(&tree, no_of_nodes)); in igraph_sir() 175 infected = RNG_INTEGER(0, no_of_nodes - 1); in igraph_sir() 180 ns = no_of_nodes - 1; in igraph_sir()
|
/dports/math/igraph/igraph-0.9.5/src/games/ |
H A D | degree_sequence.c | 44 long int no_of_nodes, no_of_edges; in igraph_i_degree_sequence_game_simple() local 61 no_of_nodes = igraph_vector_size(out_seq); in igraph_i_degree_sequence_game_simple() 70 for (i = 0; i < no_of_nodes; i++) { in igraph_i_degree_sequence_game_simple() 81 for (i = 0; i < no_of_nodes; i++) { in igraph_i_degree_sequence_game_simple() 145 long int no_of_nodes, outsum = 0; in igraph_i_degree_sequence_game_no_multiple_undirected() local 155 no_of_nodes = igraph_vector_size(seq); in igraph_i_degree_sequence_game_no_multiple_undirected() 162 IGRAPH_VECTOR_INIT_FINALLY(&residual_degrees, no_of_nodes); in igraph_i_degree_sequence_game_no_multiple_undirected() 188 for (i = 0; i < no_of_nodes; i++) { in igraph_i_degree_sequence_game_no_multiple_undirected() 289 long int no_of_nodes, outsum; in igraph_i_degree_sequence_game_no_multiple_directed() local 298 no_of_nodes = igraph_vector_size(out_seq); in igraph_i_degree_sequence_game_no_multiple_directed() [all …]
|
H A D | k_regular.c | 61 igraph_integer_t no_of_nodes, igraph_integer_t k, in igraph_k_regular_game() argument 70 if (no_of_nodes < 0) { in igraph_k_regular_game() 77 IGRAPH_VECTOR_INIT_FINALLY(°seq, no_of_nodes); in igraph_k_regular_game()
|
/dports/math/igraph/igraph-0.9.5/src/isomorphism/ |
H A D | bliss.cc | 436 long int no_of_nodes = igraph_vcount(graph1); in igraph_isomorphic_bliss() local 467 if (no_of_nodes != igraph_vcount(graph2) || in igraph_isomorphic_bliss() 484 IGRAPH_VECTOR_INIT_FINALLY(&perm1, no_of_nodes); in igraph_isomorphic_bliss() 485 IGRAPH_VECTOR_INIT_FINALLY(&perm2, no_of_nodes); in igraph_isomorphic_bliss() 490 IGRAPH_CHECK(igraph_vector_resize(mymap12, no_of_nodes)); in igraph_isomorphic_bliss() 493 for (i = 0; i < no_of_nodes; i++) { in igraph_isomorphic_bliss() 497 for (i = 0; i < no_of_nodes; i++) { in igraph_isomorphic_bliss() 526 igraph_vector_order(&from, &to, &index, no_of_nodes); in igraph_isomorphic_bliss() 538 igraph_vector_order(&from2, &to2, &index2, no_of_nodes); in igraph_isomorphic_bliss() 555 for (i = 0; i < no_of_nodes; i++) { in igraph_isomorphic_bliss() [all …]
|
/dports/databases/percona56-server/percona-server-5.6.51-91.0/storage/ndb/src/mgmapi/test/ |
H A D | keso.c | 182 ndbout_c("Number of nodes: %d", cluster->no_of_nodes); in testStatus() 183 for (i = 0; i < cluster->no_of_nodes; i++) { in testStatus() 207 if (cluster->no_of_nodes != 0) { in testLogSignals() 234 if (cluster->no_of_nodes != 0) { in testStartSignalLog() 260 if (cluster->no_of_nodes != 0) { in testStopSignalLog() 286 if (cluster->no_of_nodes != 0) { in testSetTrace() 312 if (cluster->no_of_nodes != 0) { in testInsertError() 341 if (cluster->no_of_nodes != 0) { in testDumpState() 399 if (cluster->no_of_nodes != 0) { in testSetLogLevelClusterLog() 429 if (cluster->no_of_nodes != 0) { in testSetLogLevelNode()
|
/dports/databases/percona56-client/percona-server-5.6.51-91.0/storage/ndb/src/mgmapi/test/ |
H A D | keso.c | 182 ndbout_c("Number of nodes: %d", cluster->no_of_nodes); in testStatus() 183 for (i = 0; i < cluster->no_of_nodes; i++) { in testStatus() 207 if (cluster->no_of_nodes != 0) { in testLogSignals() 234 if (cluster->no_of_nodes != 0) { in testStartSignalLog() 260 if (cluster->no_of_nodes != 0) { in testStopSignalLog() 286 if (cluster->no_of_nodes != 0) { in testSetTrace() 312 if (cluster->no_of_nodes != 0) { in testInsertError() 341 if (cluster->no_of_nodes != 0) { in testDumpState() 399 if (cluster->no_of_nodes != 0) { in testSetLogLevelClusterLog() 429 if (cluster->no_of_nodes != 0) { in testSetLogLevelNode()
|
/dports/databases/percona-pam-for-mysql/percona-server-5.6.51-91.0/storage/ndb/src/mgmapi/test/ |
H A D | keso.c | 182 ndbout_c("Number of nodes: %d", cluster->no_of_nodes); in testStatus() 183 for (i = 0; i < cluster->no_of_nodes; i++) { in testStatus() 207 if (cluster->no_of_nodes != 0) { in testLogSignals() 234 if (cluster->no_of_nodes != 0) { in testStartSignalLog() 260 if (cluster->no_of_nodes != 0) { in testStopSignalLog() 286 if (cluster->no_of_nodes != 0) { in testSetTrace() 312 if (cluster->no_of_nodes != 0) { in testInsertError() 341 if (cluster->no_of_nodes != 0) { in testDumpState() 399 if (cluster->no_of_nodes != 0) { in testSetLogLevelClusterLog() 429 if (cluster->no_of_nodes != 0) { in testSetLogLevelNode()
|
/dports/databases/percona57-server/percona-server-5.7.36-39/storage/ndb/src/mgmapi/test/ |
H A D | keso.c | 182 ndbout_c("Number of nodes: %d", cluster->no_of_nodes); in testStatus() 183 for (i = 0; i < cluster->no_of_nodes; i++) { in testStatus() 207 if (cluster->no_of_nodes != 0) { in testLogSignals() 234 if (cluster->no_of_nodes != 0) { in testStartSignalLog() 260 if (cluster->no_of_nodes != 0) { in testStopSignalLog() 286 if (cluster->no_of_nodes != 0) { in testSetTrace() 312 if (cluster->no_of_nodes != 0) { in testInsertError() 341 if (cluster->no_of_nodes != 0) { in testDumpState() 399 if (cluster->no_of_nodes != 0) { in testSetLogLevelClusterLog() 429 if (cluster->no_of_nodes != 0) { in testSetLogLevelNode()
|
/dports/databases/percona57-pam-for-mysql/percona-server-5.7.36-39/storage/ndb/src/mgmapi/test/ |
H A D | keso.c | 182 ndbout_c("Number of nodes: %d", cluster->no_of_nodes); in testStatus() 183 for (i = 0; i < cluster->no_of_nodes; i++) { in testStatus() 207 if (cluster->no_of_nodes != 0) { in testLogSignals() 234 if (cluster->no_of_nodes != 0) { in testStartSignalLog() 260 if (cluster->no_of_nodes != 0) { in testStopSignalLog() 286 if (cluster->no_of_nodes != 0) { in testSetTrace() 312 if (cluster->no_of_nodes != 0) { in testInsertError() 341 if (cluster->no_of_nodes != 0) { in testDumpState() 399 if (cluster->no_of_nodes != 0) { in testSetLogLevelClusterLog() 429 if (cluster->no_of_nodes != 0) { in testSetLogLevelNode()
|
/dports/databases/percona57-client/percona-server-5.7.36-39/storage/ndb/src/mgmapi/test/ |
H A D | keso.c | 182 ndbout_c("Number of nodes: %d", cluster->no_of_nodes); in testStatus() 183 for (i = 0; i < cluster->no_of_nodes; i++) { in testStatus() 207 if (cluster->no_of_nodes != 0) { in testLogSignals() 234 if (cluster->no_of_nodes != 0) { in testStartSignalLog() 260 if (cluster->no_of_nodes != 0) { in testStopSignalLog() 286 if (cluster->no_of_nodes != 0) { in testSetTrace() 312 if (cluster->no_of_nodes != 0) { in testInsertError() 341 if (cluster->no_of_nodes != 0) { in testDumpState() 399 if (cluster->no_of_nodes != 0) { in testSetLogLevelClusterLog() 429 if (cluster->no_of_nodes != 0) { in testSetLogLevelNode()
|
/dports/databases/mysqlwsrep57-server/mysql-wsrep-wsrep_5.7.35-25.27/storage/ndb/src/mgmapi/test/ |
H A D | keso.c | 182 ndbout_c("Number of nodes: %d", cluster->no_of_nodes); in testStatus() 183 for (i = 0; i < cluster->no_of_nodes; i++) { in testStatus() 207 if (cluster->no_of_nodes != 0) { in testLogSignals() 234 if (cluster->no_of_nodes != 0) { in testStartSignalLog() 260 if (cluster->no_of_nodes != 0) { in testStopSignalLog() 286 if (cluster->no_of_nodes != 0) { in testSetTrace() 312 if (cluster->no_of_nodes != 0) { in testInsertError() 341 if (cluster->no_of_nodes != 0) { in testDumpState() 399 if (cluster->no_of_nodes != 0) { in testSetLogLevelClusterLog() 429 if (cluster->no_of_nodes != 0) { in testSetLogLevelNode()
|
/dports/databases/xtrabackup/percona-xtrabackup-2.4.21/storage/ndb/src/mgmapi/test/ |
H A D | keso.c | 182 ndbout_c("Number of nodes: %d", cluster->no_of_nodes); in testStatus() 183 for (i = 0; i < cluster->no_of_nodes; i++) { in testStatus() 207 if (cluster->no_of_nodes != 0) { in testLogSignals() 234 if (cluster->no_of_nodes != 0) { in testStartSignalLog() 260 if (cluster->no_of_nodes != 0) { in testStopSignalLog() 286 if (cluster->no_of_nodes != 0) { in testSetTrace() 312 if (cluster->no_of_nodes != 0) { in testInsertError() 341 if (cluster->no_of_nodes != 0) { in testDumpState() 399 if (cluster->no_of_nodes != 0) { in testSetLogLevelClusterLog() 429 if (cluster->no_of_nodes != 0) { in testSetLogLevelNode()
|
/dports/databases/mysqlwsrep56-server/mysql-wsrep-wsrep_5.6.51-25.33/storage/ndb/src/mgmapi/test/ |
H A D | keso.c | 182 ndbout_c("Number of nodes: %d", cluster->no_of_nodes); in testStatus() 183 for (i = 0; i < cluster->no_of_nodes; i++) { in testStatus() 207 if (cluster->no_of_nodes != 0) { in testLogSignals() 234 if (cluster->no_of_nodes != 0) { in testStartSignalLog() 260 if (cluster->no_of_nodes != 0) { in testStopSignalLog() 286 if (cluster->no_of_nodes != 0) { in testSetTrace() 312 if (cluster->no_of_nodes != 0) { in testInsertError() 341 if (cluster->no_of_nodes != 0) { in testDumpState() 399 if (cluster->no_of_nodes != 0) { in testSetLogLevelClusterLog() 429 if (cluster->no_of_nodes != 0) { in testSetLogLevelNode()
|
/dports/databases/mysql56-client/mysql-5.6.51/storage/ndb/src/mgmapi/test/ |
H A D | keso.c | 182 ndbout_c("Number of nodes: %d", cluster->no_of_nodes); in testStatus() 183 for (i = 0; i < cluster->no_of_nodes; i++) { in testStatus() 207 if (cluster->no_of_nodes != 0) { in testLogSignals() 234 if (cluster->no_of_nodes != 0) { in testStartSignalLog() 260 if (cluster->no_of_nodes != 0) { in testStopSignalLog() 286 if (cluster->no_of_nodes != 0) { in testSetTrace() 312 if (cluster->no_of_nodes != 0) { in testInsertError() 341 if (cluster->no_of_nodes != 0) { in testDumpState() 399 if (cluster->no_of_nodes != 0) { in testSetLogLevelClusterLog() 429 if (cluster->no_of_nodes != 0) { in testSetLogLevelNode()
|
/dports/databases/mysql55-client/mysql-5.5.62/storage/ndb/src/mgmapi/test/ |
H A D | keso.c | 173 ndbout_c("Number of nodes: %d", cluster->no_of_nodes); in testStatus() 174 for (i = 0; i < cluster->no_of_nodes; i++) { in testStatus() 198 if (cluster->no_of_nodes != 0) { in testLogSignals() 225 if (cluster->no_of_nodes != 0) { in testStartSignalLog() 251 if (cluster->no_of_nodes != 0) { in testStopSignalLog() 277 if (cluster->no_of_nodes != 0) { in testSetTrace() 303 if (cluster->no_of_nodes != 0) { in testInsertError() 332 if (cluster->no_of_nodes != 0) { in testDumpState() 390 if (cluster->no_of_nodes != 0) { in testSetLogLevelClusterLog() 420 if (cluster->no_of_nodes != 0) { in testSetLogLevelNode()
|
/dports/databases/mysql55-client/mysql-5.5.62/storage/ndb/include/mgmapi/ |
H A D | mgmapi.h | 269 int no_of_nodes; member 639 int ndb_mgm_stop(NdbMgmHandle handle, int no_of_nodes, 656 int ndb_mgm_stop2(NdbMgmHandle handle, int no_of_nodes, 677 int ndb_mgm_stop3(NdbMgmHandle handle, int no_of_nodes, 696 int ndb_mgm_restart(NdbMgmHandle handle, int no_of_nodes, 716 int ndb_mgm_restart2(NdbMgmHandle handle, int no_of_nodes, 741 int ndb_mgm_restart3(NdbMgmHandle handle, int no_of_nodes, 764 int no_of_nodes,
|
/dports/math/igraph/igraph-0.9.5/src/operators/ |
H A D | contract.c | 69 long int no_of_nodes = igraph_vcount(graph); in igraph_contract_vertices() local 76 if (igraph_vector_size(mapping) != no_of_nodes) { in igraph_contract_vertices() 84 if (no_of_nodes > 0) { in igraph_contract_vertices() 136 for (i = 0; i < no_of_nodes; i++) { in igraph_contract_vertices() 146 for (i = 0; i < no_of_nodes; i++) { in igraph_contract_vertices()
|
/dports/math/igraph/igraph-0.9.5/src/layout/ |
H A D | graphopt.c | 271 long int this_node, no_of_nodes = igraph_vector_size(pending_forces_x); in igraph_i_move_nodes() local 273 for (this_node = 0; this_node < no_of_nodes; this_node++) { in igraph_i_move_nodes() 357 long int no_of_nodes = igraph_vcount(graph); in igraph_layout_graphopt() local 368 IGRAPH_VECTOR_INIT_FINALLY(&pending_forces_x, no_of_nodes); in igraph_layout_graphopt() 369 IGRAPH_VECTOR_INIT_FINALLY(&pending_forces_y, no_of_nodes); in igraph_layout_graphopt() 372 if (igraph_matrix_nrow(res) != no_of_nodes || in igraph_layout_graphopt() 395 for (this_node = 0; this_node < no_of_nodes; this_node++) { in igraph_layout_graphopt() 398 other_node < no_of_nodes; in igraph_layout_graphopt()
|
/dports/math/igraph/igraph-0.9.5/src/centrality/ |
H A D | prpack.cpp | 40 long int i, no_of_nodes = igraph_vcount(graph), nodes_to_calc; in igraph_i_personalized_pagerank_prpack() local 48 if (igraph_vector_size(reset) != no_of_nodes) { in igraph_i_personalized_pagerank_prpack() 67 v = new double[no_of_nodes]; in igraph_i_personalized_pagerank_prpack() 68 for (i = 0; i < no_of_nodes; i++) { in igraph_i_personalized_pagerank_prpack()
|
/dports/math/igraph/igraph-0.9.5/src/community/ |
H A D | leading_eigenvector.c | 488 long int no_of_nodes = igraph_vcount(graph); in igraph_community_leading_eigenvector() local 533 if (steps < 0 || steps > no_of_nodes - 1) { in igraph_community_leading_eigenvector() 534 steps = (igraph_integer_t) no_of_nodes - 1; in igraph_community_leading_eigenvector() 577 for (i = 0; i < no_of_nodes; i++) { in igraph_community_leading_eigenvector() 614 IGRAPH_VECTOR_INIT_FINALLY(&tmp, no_of_nodes); in igraph_community_leading_eigenvector() 617 IGRAPH_VECTOR_INIT_FINALLY(&idx2, no_of_nodes); in igraph_community_leading_eigenvector() 661 for (i = 0; i < no_of_nodes; i++) { in igraph_community_leading_eigenvector() 1009 if (no_of_nodes > 0) { in igraph_le_community_to_membership() 1014 if (components > no_of_nodes) { in igraph_le_community_to_membership() 1026 for (i = 0; i < no_of_nodes; i++) { in igraph_le_community_to_membership() [all …]
|
/dports/math/igraph/igraph-0.9.5/src/properties/ |
H A D | trees.c | 61 long int no_of_nodes = igraph_vcount(graph); in igraph_unfold_tree() local 64 long int tree_vertex_count = no_of_nodes; in igraph_unfold_tree() 73 long int i, n, r, v_ptr = no_of_nodes; in igraph_unfold_tree() 81 IGRAPH_VECTOR_BOOL_INIT_FINALLY(&seen_vertices, no_of_nodes); in igraph_unfold_tree() 85 IGRAPH_CHECK(igraph_vector_resize(vertex_index, no_of_nodes)); in igraph_unfold_tree() 86 for (i = 0; i < no_of_nodes; i++) { in igraph_unfold_tree()
|