/dports/math/igraph/igraph-0.9.5/src/scg/ |
H A D | scg.c | 444 no_of_nodes)); in igraph_scg_grouping() 503 for (i = 0; i < no_of_nodes; i++) { in igraph_i_scg_semiprojectors_sym() 569 for (i = 0; i < no_of_nodes; i++) { in igraph_i_scg_semiprojectors_lap() 668 for (i = 0; i < no_of_nodes; i++) { in igraph_i_scg_semiprojectors_sto() 672 for (i = 0; i < no_of_nodes; i++) { in igraph_i_scg_semiprojectors_sto() 860 no_of_nodes)); in igraph_scg_semiprojectors() 1299 int no_of_nodes = -1; in igraph_i_scg_common_checks() local 1486 int no_of_nodes; in igraph_scg_adjacency() local 1756 int no_of_nodes; in igraph_scg_stochastic() local 2112 int no_of_nodes; in igraph_scg_laplacian() local [all …]
|
/dports/math/R-cran-igraph/igraph/src/ |
H A D | scg.c | 434 no_of_nodes)); in igraph_scg_grouping() 489 for (i = 0; i < no_of_nodes; i++) { in igraph_i_scg_semiprojectors_sym() 555 for (i = 0; i < no_of_nodes; i++) { in igraph_i_scg_semiprojectors_lap() 654 for (i = 0; i < no_of_nodes; i++) { in igraph_i_scg_semiprojectors_sto() 658 for (i = 0; i < no_of_nodes; i++) { in igraph_i_scg_semiprojectors_sto() 846 no_of_nodes)); in igraph_scg_semiprojectors() 1291 int no_of_nodes = -1; in igraph_i_scg_common_checks() local 1478 int no_of_nodes; in igraph_scg_adjacency() local 1750 int no_of_nodes; in igraph_scg_stochastic() local 2107 int no_of_nodes; in igraph_scg_laplacian() local [all …]
|
H A D | decomposition.c | 60 long int no_of_nodes = igraph_vcount(graph); in igraph_maximum_cardinality_search() local 82 if (no_of_nodes == 0) { in igraph_maximum_cardinality_search() 118 for (v = 0; v < no_of_nodes; v++) { in igraph_maximum_cardinality_search() 122 VECTOR(next)[no_of_nodes - 1] = 0; in igraph_maximum_cardinality_search() 129 i = no_of_nodes; j = 0; in igraph_maximum_cardinality_search() 219 if (j < no_of_nodes) { in igraph_maximum_cardinality_search() 280 long int no_of_nodes = igraph_vcount(graph); in igraph_is_chordal() local 313 for (v = 0; v < no_of_nodes; v++) { in igraph_is_chordal() 321 for (i = 0; i < no_of_nodes; i++) { in igraph_is_chordal() 352 for (i = 0; i < no_of_nodes; i++) { in igraph_is_chordal() [all …]
|
H A D | separators.c | 46 if (IGRAPH_VIT_SIZE(*vit) >= no_of_nodes - 1) { in igraph_i_is_separator() 63 if (nohit >= no_of_nodes - 1) { in igraph_i_is_separator() 98 if (start == no_of_nodes) { in igraph_i_is_separator() 125 *res = (start < no_of_nodes); in igraph_i_is_separator() 150 long int no_of_nodes = igraph_vcount(graph); in igraph_is_separator() local 208 long int no_of_nodes = igraph_vcount(graph); in igraph_is_minimal_separator() local 281 for (i = 0; i < no_of_nodes; i++) { in igraph_i_clusters_leaveout() 485 for (v = 0; v < no_of_nodes; v++) { in igraph_all_minimal_st_separators() 705 } else if (conn == no_of_nodes - 1) { in igraph_minimum_size_separators() 709 for (i = 0; i < no_of_nodes; i++) { in igraph_minimum_size_separators() [all …]
|
H A D | layout.c | 206 if (no_of_nodes == 1) { in igraph_layout_star() 254 if (no_of_nodes != 0) { in igraph_layout_sphere() 265 if (no_of_nodes >= 2) { in igraph_layout_sphere() 700 long int no_of_nodes, in igraph_i_layout_reingold_tilford_unreachable() argument 1362 no_of_nodes++; in igraph_layout_reingold_tilford() 1472 igraph_real_t ratio = 2 * M_PI * (no_of_nodes - 1.0) / no_of_nodes; in igraph_layout_reingold_tilford_circular() 1477 if (no_of_nodes == 0) { in igraph_layout_reingold_tilford_circular() 2224 if (no_of_nodes == 1) { in igraph_i_layout_mds_single() 2229 if (no_of_nodes == 2) { in igraph_i_layout_mds_single() 2362 if (dim > no_of_nodes) { in igraph_layout_mds() [all …]
|
H A D | flow.c | 276 long int min = no_of_nodes; in igraph_i_mf_relabel() 279 DIST(v) = no_of_nodes; in igraph_i_mf_relabel() 287 if (min < no_of_nodes) { in igraph_i_mf_relabel() 510 if (source < 0 || source >= no_of_nodes || target < 0 || target >= no_of_nodes) { in igraph_maxflow() 628 IGRAPH_CHECK(igraph_buckets_init(&buckets, no_of_nodes + 1, no_of_nodes)); in igraph_maxflow() 630 IGRAPH_CHECK(igraph_dbuckets_init(&ibuckets, no_of_nodes + 1, no_of_nodes)); in igraph_maxflow() 649 if (npushsince > no_of_nodes / 2 && nrelabelsince > no_of_nodes) { in igraph_maxflow() 1761 if (source < 0 || source >= no_of_nodes || target < 0 || target >= no_of_nodes) { in igraph_i_st_vertex_connectivity_directed() 1783 *res = no_of_nodes; in igraph_i_st_vertex_connectivity_directed() 1845 if (source < 0 || source >= no_of_nodes || target < 0 || target >= no_of_nodes) { in igraph_i_st_vertex_connectivity_undirected() [all …]
|
H A D | structure_generators.c | 119 for (i = 0; i < no_of_nodes; i++) { in igraph_i_adjacency_directed() 137 for (i = 0; i < no_of_nodes; i++) { in igraph_i_adjacency_max() 159 for (i = 0; i < no_of_nodes; i++) { in igraph_i_adjacency_upper() 274 long int no_of_nodes; in igraph_adjacency() local 590 long int no_of_nodes; in igraph_weighted_adjacency() local 1492 no_of_edges = no_of_nodes * m; in igraph_de_bruijn() 1574 no_of_edges = no_of_nodes * m; in igraph_kautz() 1615 if (idx >= no_of_nodes) { in igraph_kautz() 1702 long int no_of_nodes = n; in igraph_lcf_vector() local 1710 if (no_of_nodes > 0) { in igraph_lcf_vector() [all …]
|
H A D | spectral_properties.c | 36 int no_of_nodes = (int) igraph_vcount(graph); in igraph_i_weighted_laplacian() local 47 IGRAPH_CHECK(igraph_matrix_resize(res, no_of_nodes, no_of_nodes)); in igraph_i_weighted_laplacian() 52 no_of_edges * 2 + no_of_nodes; in igraph_i_weighted_laplacian() 53 igraph_sparsemat_resize(sparseres, no_of_nodes, no_of_nodes, nz); in igraph_i_weighted_laplacian() 84 for (i = 0; i < no_of_nodes; i++) { in igraph_i_weighted_laplacian() 107 for (i = 0; i < no_of_nodes; i++) { in igraph_i_weighted_laplacian() 165 for (i = 0; i < no_of_nodes; i++) { in igraph_i_weighted_laplacian() 189 for (i = 0; i < no_of_nodes; i++) { in igraph_i_weighted_laplacian() 297 IGRAPH_CHECK(igraph_matrix_resize(res, no_of_nodes, no_of_nodes)); in igraph_laplacian() 302 no_of_edges * 2 + no_of_nodes; in igraph_laplacian() [all …]
|
H A D | st-cuts.c | 72 for (i = 0; i < no_of_nodes; i++) { in igraph_even_tarjan_reduction() 411 if (root < 0 || root >= no_of_nodes) { in igraph_dominator_tree() 459 for (i = 0; i < no_of_nodes; i++) { in igraph_dominator_tree() 480 for (i = 0; i < no_of_nodes; i++) { in igraph_dominator_tree() 656 for (i = 0; i < no_of_nodes; i++) { in igraph_i_all_st_cuts_minimal() 674 for (i = 0; i < no_of_nodes; i++) { in igraph_i_all_st_cuts_minimal() 719 for (i = 0; i < no_of_nodes; i++) { in igraph_i_all_st_cuts_pivot() 797 for (i = 0; i < no_of_nodes; i++) { in igraph_i_all_st_cuts_pivot() 1141 for (i = 0; i < no_of_nodes; i++) { in igraph_i_all_st_mincuts_minimal() 1214 for (i = 0; i < no_of_nodes; i++) { in igraph_i_all_st_mincuts_pivot() [all …]
|
/dports/math/igraph/igraph-0.9.5/src/layout/ |
H A D | circular.c | 51 long int no_of_nodes = igraph_vcount(graph); in igraph_layout_circle() local 93 long int no_of_nodes = igraph_vcount(graph); in igraph_layout_star() local 99 if (center < 0 || center >= no_of_nodes) { in igraph_layout_star() 108 if (no_of_nodes == 1) { in igraph_layout_star() 112 i < no_of_nodes; i++) { in igraph_layout_star() 158 if (no_of_nodes != 0) { in igraph_layout_sphere() 162 for (i = 1; i < no_of_nodes - 1; i++) { in igraph_layout_sphere() 169 if (no_of_nodes >= 2) { in igraph_layout_sphere() 170 MATRIX(*res, no_of_nodes - 1, 0) = 0; in igraph_layout_sphere() 171 MATRIX(*res, no_of_nodes - 1, 1) = 0; in igraph_layout_sphere() [all …]
|
H A D | mds.c | 64 if (no_of_nodes == 1) { in igraph_i_layout_mds_single() 69 if (no_of_nodes == 2) { in igraph_i_layout_mds_single() 84 for (i = 0; i < no_of_nodes; i++) { in igraph_i_layout_mds_single() 85 for (j = 0; j < no_of_nodes; j++) { in igraph_i_layout_mds_single() 96 for (i = 0; i < no_of_nodes; i++) { in igraph_i_layout_mds_single() 97 for (j = 0; j < no_of_nodes; j++) { in igraph_i_layout_mds_single() 120 for (i = 0; i < no_of_nodes; i++) { in igraph_i_layout_mds_single() 199 if (dim > no_of_nodes) { in igraph_layout_mds() 205 IGRAPH_CHECK(igraph_matrix_init(&m, no_of_nodes, no_of_nodes)); in igraph_layout_mds() 213 for (i = 0; i < no_of_nodes; i++) { in igraph_layout_mds() [all …]
|
H A D | layout_grid.c | 45 long int i, no_of_nodes = igraph_vcount(graph); in igraph_layout_grid() local 48 IGRAPH_CHECK(igraph_matrix_resize(res, no_of_nodes, 2)); in igraph_layout_grid() 51 width = (long int) ceil(sqrt(no_of_nodes)); in igraph_layout_grid() 55 for (i = 0; i < no_of_nodes; i++) { in igraph_layout_grid() 86 long int i, no_of_nodes = igraph_vcount(graph); in igraph_layout_grid_3d() local 89 IGRAPH_CHECK(igraph_matrix_resize(res, no_of_nodes, 3)); in igraph_layout_grid_3d() 92 width = height = (long int) ceil(pow(no_of_nodes, 1.0 / 3)); in igraph_layout_grid_3d() 94 width = (long int) ceil(sqrt(no_of_nodes / (double)height)); in igraph_layout_grid_3d() 96 height = (long int) ceil(sqrt(no_of_nodes / (double)width)); in igraph_layout_grid_3d() 100 for (i = 0; i < no_of_nodes; i++) { in igraph_layout_grid_3d()
|
H A D | reingold_tilford.c | 41 long int no_of_nodes, in igraph_i_layout_reingold_tilford_unreachable() argument 76 for (j = 0; j < no_of_nodes; j++) { in igraph_i_layout_reingold_tilford_unreachable() 85 for (i = 0; i < no_of_nodes; i++) { in igraph_i_layout_reingold_tilford_unreachable() 157 for (i = 0; i < no_of_nodes; i++) { in igraph_i_layout_reingold_tilford() 211 for (i = 0; i < no_of_nodes; i++) { in igraph_i_layout_reingold_tilford() 759 no_of_nodes++; in igraph_layout_reingold_tilford() 767 no_of_nodes++; in igraph_layout_reingold_tilford() 824 real_root = no_of_nodes; in igraph_layout_reingold_tilford() 826 no_of_nodes++; in igraph_layout_reingold_tilford() 939 if (no_of_nodes == 0) { in igraph_layout_reingold_tilford_circular() [all …]
|
/dports/math/igraph/igraph-0.9.5/src/games/ |
H A D | static_fitness.c | 95 igraph_integer_t no_of_nodes; in igraph_static_fitness_game() local 115 if (no_of_nodes == 0) { in igraph_static_fitness_game() 136 for (i = 0; i < no_of_nodes; i++) { in igraph_static_fitness_game() 369 if (no_of_nodes < 0) { in igraph_static_power_law_game() 384 j = no_of_nodes; in igraph_static_power_law_game() 390 if (j < no_of_nodes) { in igraph_static_power_law_game() 391 j = no_of_nodes; in igraph_static_power_law_game() 393 for (i = 0; i < no_of_nodes; i++, j--) { in igraph_static_power_law_game() 408 j = no_of_nodes; in igraph_static_power_law_game() 414 if (j < no_of_nodes) { in igraph_static_power_law_game() [all …]
|
H A D | recent_degree.c | 73 long int no_of_nodes = nodes; in igraph_recent_degree_game() local 84 if (no_of_nodes < 0) { in igraph_recent_degree_game() 109 no_of_edges = (no_of_nodes - 1) * no_of_neighbors; in igraph_recent_degree_game() 121 IGRAPH_VECTOR_INIT_FINALLY(°ree, no_of_nodes); in igraph_recent_degree_game() 133 for (i = 1; i < no_of_nodes; i++) { in igraph_recent_degree_game() 236 long int no_of_nodes = nodes; in igraph_recent_degree_aging_game() local 248 if (no_of_nodes == 0) { in igraph_recent_degree_aging_game() 252 if (no_of_nodes < 0) { in igraph_recent_degree_aging_game() 274 no_of_edges = (no_of_nodes - 1) * no_of_neighbors; in igraph_recent_degree_aging_game() 288 IGRAPH_VECTOR_INIT_FINALLY(°ree, no_of_nodes); in igraph_recent_degree_aging_game() [all …]
|
/dports/math/igraph/igraph-0.9.5/src/constructors/ |
H A D | adjacency.c | 45 for (i = 0; i < no_of_nodes; i++) { in igraph_i_adjacency_directed() 63 for (i = 0; i < no_of_nodes; i++) { in igraph_i_adjacency_max() 85 for (i = 0; i < no_of_nodes; i++) { in igraph_i_adjacency_upper() 102 for (i = 0; i < no_of_nodes; i++) { in igraph_i_adjacency_lower() 119 for (i = 0; i < no_of_nodes; i++) { in igraph_i_adjacency_min() 199 long int no_of_nodes; in igraph_adjacency() local 279 for (i = 0; i < no_of_nodes; i++) { in igraph_i_weighted_adjacency_directed() 306 for (i = 0; i < no_of_nodes; i++) { in igraph_i_weighted_adjacency_plus() 336 for (i = 0; i < no_of_nodes; i++) { in igraph_i_weighted_adjacency_max() 366 for (i = 0; i < no_of_nodes; i++) { in igraph_i_weighted_adjacency_upper() [all …]
|
/dports/math/igraph/igraph-0.9.5/src/misc/ |
H A D | chordality.c | 72 long int no_of_nodes = igraph_vcount(graph); in igraph_maximum_cardinality_search() local 84 if (no_of_nodes == 0) { in igraph_maximum_cardinality_search() 120 for (v = 0; v < no_of_nodes; v++) { in igraph_maximum_cardinality_search() 124 VECTOR(next)[no_of_nodes - 1] = 0; in igraph_maximum_cardinality_search() 131 i = no_of_nodes; j = 0; in igraph_maximum_cardinality_search() 221 if (j < no_of_nodes) { in igraph_maximum_cardinality_search() 286 long int no_of_nodes = igraph_vcount(graph); in igraph_is_chordal() local 329 for (v = 0; v < no_of_nodes; v++) { in igraph_is_chordal() 337 for (i = 0; i < no_of_nodes; i++) { in igraph_is_chordal() 368 for (i = 0; i < no_of_nodes; i++) { in igraph_is_chordal() [all …]
|
/dports/math/igraph/igraph-0.9.5/src/connectivity/ |
H A D | separators.c | 49 if (IGRAPH_VIT_SIZE(*vit) >= no_of_nodes - 1) { in igraph_i_is_separator() 66 if (nohit >= no_of_nodes - 1) { in igraph_i_is_separator() 101 if (start == no_of_nodes) { in igraph_i_is_separator() 128 *res = (start < no_of_nodes); in igraph_i_is_separator() 153 long int no_of_nodes = igraph_vcount(graph); in igraph_is_separator() local 212 long int no_of_nodes = igraph_vcount(graph); in igraph_is_minimal_separator() local 285 for (i = 0; i < no_of_nodes; i++) { in igraph_i_clusters_leaveout() 503 for (v = 0; v < no_of_nodes; v++) { in igraph_all_minimal_st_separators() 724 } else if (conn == no_of_nodes - 1) { in igraph_minimum_size_separators() 728 for (i = 0; i < no_of_nodes; i++) { in igraph_minimum_size_separators() [all …]
|
/dports/math/igraph/igraph-0.9.5/src/properties/ |
H A D | basic_properties.c | 61 igraph_integer_t no_of_nodes = igraph_vcount(graph); in igraph_density() local 65 if (no_of_nodes == 0) { in igraph_density() 71 if (no_of_nodes == 1) { in igraph_density() 74 *res = no_of_edges / no_of_nodes / (no_of_nodes - 1); in igraph_density() 76 *res = no_of_edges / no_of_nodes * 2.0 / (no_of_nodes - 1); in igraph_density() 80 *res = no_of_edges / no_of_nodes / no_of_nodes; in igraph_density() 82 *res = no_of_edges / no_of_nodes * 2.0 / (no_of_nodes + 1); in igraph_density() 126 int no_of_nodes = igraph_vcount(graph); in igraph_diversity() local 155 for (i = 0; i < no_of_nodes; i++) { in igraph_diversity() 245 long int no_of_nodes = igraph_vcount(graph); in igraph_reciprocity() local [all …]
|
H A D | spectral.c | 36 int no_of_nodes = (int) igraph_vcount(graph); in igraph_i_weighted_laplacian() local 47 IGRAPH_CHECK(igraph_matrix_resize(res, no_of_nodes, no_of_nodes)); in igraph_i_weighted_laplacian() 52 no_of_edges * 2 + no_of_nodes; in igraph_i_weighted_laplacian() 53 igraph_sparsemat_resize(sparseres, no_of_nodes, no_of_nodes, nz); in igraph_i_weighted_laplacian() 84 for (i = 0; i < no_of_nodes; i++) { in igraph_i_weighted_laplacian() 107 for (i = 0; i < no_of_nodes; i++) { in igraph_i_weighted_laplacian() 165 for (i = 0; i < no_of_nodes; i++) { in igraph_i_weighted_laplacian() 189 for (i = 0; i < no_of_nodes; i++) { in igraph_i_weighted_laplacian() 297 IGRAPH_CHECK(igraph_matrix_resize(res, no_of_nodes, no_of_nodes)); in igraph_laplacian() 302 no_of_edges * 2 + no_of_nodes; in igraph_laplacian() [all …]
|
H A D | triangles_template.h | 29 long int no_of_nodes = igraph_vcount(graph); 45 if (no_of_nodes == 0) { 54 igraph_vector_int_init(&order, no_of_nodes); 56 IGRAPH_VECTOR_INIT_FINALLY(°ree, no_of_nodes); 61 for (i = 0; i < no_of_nodes; i++) { 67 igraph_vector_int_init(&rank, no_of_nodes); 69 for (i = 0; i < no_of_nodes; i++) { 70 VECTOR(rank)[ VECTOR(order)[i] ] = no_of_nodes - i - 1; 75 neis = IGRAPH_CALLOC(no_of_nodes, long int); 82 IGRAPH_CHECK(igraph_vector_resize(res, no_of_nodes)); [all …]
|
/dports/math/igraph/igraph-0.9.5/src/community/ |
H A D | edge_betweenness.c | 72 long int no_of_nodes = igraph_vcount(graph); in igraph_i_community_eb_get_merges2() local 103 for (i = 0; i < no_of_nodes; i++) { in igraph_i_community_eb_get_merges2() 135 for (j = 0; j < no_of_nodes; j++) { in igraph_i_community_eb_get_merges2() 230 long int no_of_nodes = igraph_vcount(graph); in igraph_community_eb_get_merges() local 236 if (no_of_nodes == 0) { in igraph_community_eb_get_merges() 292 VECTOR(ptr)[c1] = no_of_nodes + midx + 1; in igraph_community_eb_get_merges() 293 VECTOR(ptr)[c2] = no_of_nodes + midx + 1; in igraph_community_eb_get_merges() 399 long int no_of_nodes = igraph_vcount(graph); in igraph_community_edge_betweenness() local 448 distance = IGRAPH_CALLOC(no_of_nodes, double); in igraph_community_edge_betweenness() 453 nrgeo = IGRAPH_CALLOC(no_of_nodes, double); in igraph_community_edge_betweenness() [all …]
|
H A D | optimal_modularity.c | 93 int no_of_variables = no_of_nodes * (no_of_nodes + 1) / 2; in igraph_community_optimal_modularity() 121 if (no_of_nodes < 2) { in igraph_community_optimal_modularity() 152 IGRAPH_VECTOR_INIT_FINALLY(&indegree, no_of_nodes); in igraph_community_optimal_modularity() 153 IGRAPH_VECTOR_INIT_FINALLY(&outdegree, no_of_nodes); in igraph_community_optimal_modularity() 175 for (i = 0; i < no_of_nodes; i++) { in igraph_community_optimal_modularity() 180 for (i = 0; i < no_of_nodes; i++) { in igraph_community_optimal_modularity() 181 for (j = i + 1; j < no_of_nodes; j++) { in igraph_community_optimal_modularity() 185 for (k = j + 1; k < no_of_nodes; k++) { in igraph_community_optimal_modularity() 210 for (i = 0; i < no_of_nodes; i++) { in igraph_community_optimal_modularity() 211 for (j = i + 1; j < no_of_nodes; j++) { in igraph_community_optimal_modularity() [all …]
|
/dports/math/igraph/igraph-0.9.5/src/flow/ |
H A D | flow.c | 282 long int min = no_of_nodes; in igraph_i_mf_relabel() 285 DIST(v) = no_of_nodes; in igraph_i_mf_relabel() 293 if (min < no_of_nodes) { in igraph_i_mf_relabel() 523 if (source < 0 || source >= no_of_nodes || target < 0 || target >= no_of_nodes) { in igraph_maxflow() 641 IGRAPH_CHECK(igraph_buckets_init(&buckets, no_of_nodes + 1, no_of_nodes)); in igraph_maxflow() 643 IGRAPH_CHECK(igraph_dbuckets_init(&ibuckets, no_of_nodes + 1, no_of_nodes)); in igraph_maxflow() 662 if (npushsince > no_of_nodes / 2 && nrelabelsince > no_of_nodes) { in igraph_maxflow() 1774 if (source < 0 || source >= no_of_nodes || target < 0 || target >= no_of_nodes) { in igraph_i_st_vertex_connectivity_directed() 1795 *res = no_of_nodes; in igraph_i_st_vertex_connectivity_directed() 1854 if (source < 0 || source >= no_of_nodes || target < 0 || target >= no_of_nodes) { in igraph_i_st_vertex_connectivity_undirected() [all …]
|
H A D | st-cuts.c | 108 for (i = 0; i < no_of_nodes; i++) { in igraph_even_tarjan_reduction() 447 if (root < 0 || root >= no_of_nodes) { in igraph_dominator_tree() 495 for (i = 0; i < no_of_nodes; i++) { in igraph_dominator_tree() 516 for (i = 0; i < no_of_nodes; i++) { in igraph_dominator_tree() 692 for (i = 0; i < no_of_nodes; i++) { in igraph_i_all_st_cuts_minimal() 710 for (i = 0; i < no_of_nodes; i++) { in igraph_i_all_st_cuts_minimal() 755 for (i = 0; i < no_of_nodes; i++) { in igraph_i_all_st_cuts_pivot() 833 for (i = 0; i < no_of_nodes; i++) { in igraph_i_all_st_cuts_pivot() 1175 for (i = 0; i < no_of_nodes; i++) { in igraph_i_all_st_mincuts_minimal() 1248 for (i = 0; i < no_of_nodes; i++) { in igraph_i_all_st_mincuts_pivot() [all …]
|