Home
last modified time | relevance | path

Searched refs:no_of_edges (Results 1 – 25 of 113) sorted by relevance

12345

/dports/math/igraph/igraph-0.9.5/src/misc/
H A Dmixing.c68 long int no_of_edges = igraph_ecount(graph); in igraph_assortativity_nominal() local
89 for (e = 0; e < no_of_edges; e++) { in igraph_assortativity_nominal()
110 sumaibi += (VECTOR(ai)[i] / no_of_edges) * (VECTOR(bi)[i] / no_of_edges); in igraph_assortativity_nominal()
111 sumeii += (VECTOR(eii)[i] / no_of_edges); in igraph_assortativity_nominal()
179 long int no_of_edges = igraph_ecount(graph); in igraph_assortativity() local
199 for (e = 0; e < no_of_edges; e++) { in igraph_assortativity()
210 num1 /= no_of_edges; in igraph_assortativity()
211 den1 /= no_of_edges * 2; in igraph_assortativity()
212 num2 /= no_of_edges * 2; in igraph_assortativity()
226 for (e = 0; e < no_of_edges; e++) { in igraph_assortativity()
[all …]
H A Dconversion.c297 long int no_of_edges = igraph_ecount(graph); in igraph_get_edgelist() local
301 IGRAPH_CHECK(igraph_vector_resize(res, no_of_edges * 2)); in igraph_get_edgelist()
310 VECTOR(*res)[vptr + no_of_edges] = to; in igraph_get_edgelist()
361 long int no_of_edges = igraph_ecount(graph); in igraph_to_directed() local
375 long int size = no_of_edges * 2; in igraph_to_directed()
384 for (i=0; i < no_of_edges; ++i) { in igraph_to_directed()
401 for (i=0; i < no_of_edges; ++i) { in igraph_to_directed()
429 long int size = no_of_edges * 4; in igraph_to_directed()
435 IGRAPH_VECTOR_INIT_FINALLY(&index, no_of_edges * 2); in igraph_to_directed()
436 for (i = 0; i < no_of_edges; i++) { in igraph_to_directed()
[all …]
/dports/math/R-cran-igraph/igraph/src/
H A Dmixing.c67 long int no_of_edges = igraph_ecount(graph); in igraph_assortativity_nominal() local
88 for (e = 0; e < no_of_edges; e++) { in igraph_assortativity_nominal()
109 sumaibi += (VECTOR(ai)[i] / no_of_edges) * (VECTOR(bi)[i] / no_of_edges); in igraph_assortativity_nominal()
110 sumeii += (VECTOR(eii)[i] / no_of_edges); in igraph_assortativity_nominal()
178 long int no_of_edges = igraph_ecount(graph); in igraph_assortativity() local
198 for (e = 0; e < no_of_edges; e++) { in igraph_assortativity()
209 num1 /= no_of_edges; in igraph_assortativity()
210 den1 /= no_of_edges * 2; in igraph_assortativity()
211 num2 /= no_of_edges * 2; in igraph_assortativity()
225 for (e = 0; e < no_of_edges; e++) { in igraph_assortativity()
[all …]
H A Dconversion.c291 long int no_of_edges = igraph_ecount(graph); in igraph_get_edgelist() local
295 IGRAPH_CHECK(igraph_vector_resize(res, no_of_edges * 2)); in igraph_get_edgelist()
304 VECTOR(*res)[vptr + no_of_edges] = to; in igraph_get_edgelist()
358 long int no_of_edges = igraph_ecount(graph); in igraph_to_directed() local
360 long int size = no_of_edges * 2; in igraph_to_directed()
380 long int no_of_edges = igraph_ecount(graph); in igraph_to_directed() local
382 long int size = no_of_edges * 4; in igraph_to_directed()
388 IGRAPH_VECTOR_INIT_FINALLY(&index, no_of_edges * 2); in igraph_to_directed()
389 for (i = 0; i < no_of_edges; i++) { in igraph_to_directed()
447 long int no_of_edges = igraph_ecount(graph); in igraph_to_undirected() local
[all …]
H A Dflow.c182 for (i = 0; i < no_of_edges; i++) { in igraph_i_maxflow_undirected()
198 if (VECTOR(*cut)[i] >= no_of_edges) { in igraph_i_maxflow_undirected()
199 VECTOR(*cut)[i] -= no_of_edges; in igraph_i_maxflow_undirected()
211 for (i = 0; i < no_of_edges; i++) { in igraph_i_maxflow_undirected()
579 for (i = 0; i < no_of_edges; i += 2) { in igraph_maxflow()
599 for (i = 1; i < no_of_edges; i++) { in igraph_maxflow()
608 VECTOR(first)[idx++] = no_of_edges; in igraph_maxflow()
893 for (i = 0; i < no_of_edges; i += 2) { in igraph_maxflow()
1460 for (i = 0; i < no_of_edges; i++) { in igraph_i_mincut_undirected()
1801 for (i = 0; i < 2 * no_of_edges; i += 2) { in igraph_i_st_vertex_connectivity_directed()
[all …]
H A Dtype_indexededgelist.c290 ret1 = igraph_vector_init(&newoi, no_of_edges); in igraph_add_edges()
414 long int no_of_edges = igraph_ecount(graph); in igraph_delete_edges() local
425 mark = igraph_Calloc(no_of_edges, int); in igraph_delete_edges()
470 for (i = 0, j = 0; i < no_of_edges; i++) { in igraph_delete_edges()
537 long int no_of_edges = igraph_ecount(graph); in igraph_delete_vertices_idx() local
641 for (i = 0; i < no_of_edges; i++) { in igraph_delete_vertices_idx()
839 long int no_of_edges; in igraph_i_create_start() local
843 no_of_edges = igraph_vector_size(el); in igraph_i_create_start()
859 for (i = 1; i < no_of_edges; i++) { in igraph_i_create_start()
1433 long int no_of_edges = igraph_ecount(graph); in igraph_get_eids_multipairs() local
[all …]
H A Dgames.c119 bagsize = no_of_nodes + no_of_edges + (outpref ? no_of_edges : 0); in igraph_i_barabasi_game_bag()
1606 long int no_of_edges; in igraph_growing_random_game() local
1899 long int no_of_edges; in igraph_recent_degree_game() local
1922 no_of_edges = 0; in igraph_recent_degree_game()
2062 long int no_of_edges; in igraph_barabasi_aging_game() local
2086 no_of_edges = 0; in igraph_barabasi_aging_game()
2217 long int no_of_edges; in igraph_recent_degree_aging_game() local
2242 no_of_edges = 0; in igraph_recent_degree_aging_game()
4039 if (no_of_edges < 0) { in igraph_static_fitness_game()
4136 no_of_edges--; in igraph_static_fitness_game()
[all …]
/dports/math/igraph/igraph-0.9.5/src/paths/
H A Djohnson.c75 long int no_of_edges = igraph_ecount(graph); in igraph_shortest_paths_johnson() local
88 if (igraph_vector_size(weights) != no_of_edges) { in igraph_shortest_paths_johnson()
93 if (no_of_edges == 0) { in igraph_shortest_paths_johnson()
125 IGRAPH_VECTOR_INIT_FINALLY(&edges, no_of_edges * 2 + no_of_nodes * 2); in igraph_shortest_paths_johnson()
127 igraph_vector_resize(&edges, no_of_edges * 2 + no_of_nodes * 2); in igraph_shortest_paths_johnson()
128 for (i = 0, ptr = no_of_edges * 2; i < no_of_nodes; i++) { in igraph_shortest_paths_johnson()
136 IGRAPH_CHECK(igraph_vector_reserve(&newweights, no_of_edges + no_of_nodes)); in igraph_shortest_paths_johnson()
138 igraph_vector_resize(&newweights, no_of_edges + no_of_nodes); in igraph_shortest_paths_johnson()
139 for (i = no_of_edges; i < no_of_edges + no_of_nodes; i++) { in igraph_shortest_paths_johnson()
157 igraph_vector_resize(&newweights, no_of_edges); in igraph_shortest_paths_johnson()
[all …]
/dports/math/igraph/igraph-0.9.5/src/games/
H A Dstatic_fitness.c91 int igraph_static_fitness_game(igraph_t *graph, igraph_integer_t no_of_edges, in igraph_static_fitness_game() argument
110 if (no_of_edges < 0) { in igraph_static_fitness_game()
159 if (no_of_edges > max_no_of_edges) { in igraph_static_fitness_game()
180 num_steps = no_of_edges; in igraph_static_fitness_game()
185 IGRAPH_CHECK(igraph_vector_reserve(&edges, 2 * no_of_edges)); in igraph_static_fitness_game()
187 while (no_of_edges > 0) { in igraph_static_fitness_game()
207 no_of_edges--; in igraph_static_fitness_game()
223 while (no_of_edges > 0) { in igraph_static_fitness_game()
254 no_of_edges--; in igraph_static_fitness_game()
422 IGRAPH_CHECK(igraph_static_fitness_game(graph, no_of_edges, in igraph_static_power_law_game()
[all …]
H A Drecent_degree.c75 long int no_of_edges; in igraph_recent_degree_game() local
109 no_of_edges = (no_of_nodes - 1) * no_of_neighbors; in igraph_recent_degree_game()
112 no_of_edges = 0; in igraph_recent_degree_game()
114 no_of_edges += VECTOR(*outseq)[i]; in igraph_recent_degree_game()
118 IGRAPH_VECTOR_INIT_FINALLY(&edges, no_of_edges * 2); in igraph_recent_degree_game()
123 1.5 * time_window * no_of_edges / no_of_nodes + 10)); in igraph_recent_degree_game()
239 long int no_of_edges; in igraph_recent_degree_aging_game() local
274 no_of_edges = (no_of_nodes - 1) * no_of_neighbors; in igraph_recent_degree_aging_game()
277 no_of_edges = 0; in igraph_recent_degree_aging_game()
279 no_of_edges += VECTOR(*outseq)[i]; in igraph_recent_degree_aging_game()
[all …]
H A Dbarabasi.c93 no_of_edges = start_edges + new_edges; in igraph_i_barabasi_game_bag()
95 bagsize = no_of_nodes + no_of_edges + (outpref ? no_of_edges : 0); in igraph_i_barabasi_game_bag()
97 IGRAPH_VECTOR_INIT_FINALLY(&edges, no_of_edges * 2); in igraph_i_barabasi_game_bag()
130 igraph_vector_resize(&edges, no_of_edges * 2); in igraph_i_barabasi_game_bag()
206 no_of_edges = start_edges + new_edges; in igraph_i_barabasi_game_psumtree_multiple()
209 IGRAPH_VECTOR_INIT_FINALLY(&edges, no_of_edges * 2); in igraph_i_barabasi_game_psumtree_multiple()
231 igraph_vector_resize(&edges, no_of_edges * 2); in igraph_i_barabasi_game_psumtree_multiple()
313 no_of_edges = start_edges + new_edges; in igraph_i_barabasi_game_psumtree()
627 long int no_of_edges; in igraph_barabasi_aging_game() local
684 no_of_edges = 0; in igraph_barabasi_aging_game()
[all …]
H A Dcorrelated.c58 int no_of_edges = igraph_ecount(old_graph); in igraph_correlated_game() local
62 igraph_real_t no_of_missing = no_of_all - no_of_edges; in igraph_correlated_game()
97 IGRAPH_VECTOR_INIT_FINALLY(&edges, no_of_edges * 2); in igraph_correlated_game()
115 IGRAPH_VECTOR_INIT_FINALLY(&edges, no_of_edges * 2); in igraph_correlated_game()
123 while (last < no_of_edges) { in igraph_correlated_game()
169 (no_of_edges - no_del + no_add) * 2)); in igraph_correlated_game()
175 { if (p_e < no_of_edges) { next_e=CODEE(); } else { next_e = inf; } } in igraph_correlated_game()
H A Dgrowing_random.c61 long int no_of_edges; in igraph_growing_random_game() local
75 no_of_edges = (no_of_nodes - 1) * no_of_neighbors; in igraph_growing_random_game()
77 IGRAPH_VECTOR_INIT_FINALLY(&edges, no_of_edges * 2); in igraph_growing_random_game()
/dports/math/igraph/igraph-0.9.5/src/properties/
H A Dconvergence_degree.c76 long int no_of_edges = igraph_ecount(graph); in igraph_convergence_degree() local
86 IGRAPH_CHECK(igraph_vector_resize(result, no_of_edges)); in igraph_convergence_degree()
93 IGRAPH_VECTOR_INIT_FINALLY(ins_p, no_of_edges); in igraph_convergence_degree()
96 IGRAPH_CHECK(igraph_vector_resize(ins_p, no_of_edges)); in igraph_convergence_degree()
102 IGRAPH_VECTOR_INIT_FINALLY(outs_p, no_of_edges); in igraph_convergence_degree()
105 IGRAPH_CHECK(igraph_vector_resize(outs_p, no_of_edges)); in igraph_convergence_degree()
180 for (i = 0; i < no_of_edges; i++) { in igraph_convergence_degree()
186 for (i = 0; i < no_of_edges; i++) { in igraph_convergence_degree()
H A Dbasic_properties.c62 igraph_real_t no_of_edges = igraph_ecount(graph); in igraph_density() local
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()
127 int no_of_edges = igraph_ecount(graph); in igraph_diversity() local
142 if (igraph_vector_size(weights) != no_of_edges) { in igraph_diversity()
/dports/math/igraph/igraph-0.9.5/src/constructors/
H A Dlinegraph.c33 long int no_of_edges = igraph_ecount(graph); in igraph_i_linegraph_undirected() local
43 for (i = 0; i < no_of_edges; i++) { in igraph_i_linegraph_undirected()
80 igraph_create(linegraph, &edges, (igraph_integer_t) no_of_edges, in igraph_i_linegraph_undirected()
89 long int no_of_edges = igraph_ecount(graph); in igraph_i_linegraph_directed() local
98 for (i = 0; i < no_of_edges; i++) { in igraph_i_linegraph_directed()
119 igraph_create(linegraph, &edges, (igraph_integer_t) no_of_edges, igraph_is_directed(graph)); in igraph_i_linegraph_directed()
H A Dde_bruijn.c61 long int no_of_nodes, no_of_edges; in igraph_de_bruijn() local
79 no_of_edges = no_of_nodes * m; in igraph_de_bruijn()
82 IGRAPH_CHECK(igraph_vector_reserve(&edges, no_of_edges * 2)); in igraph_de_bruijn()
/dports/math/igraph/igraph-0.9.5/src/isomorphism/
H A Dbliss.cc437 long int no_of_edges = igraph_ecount(graph1); in igraph_isomorphic_bliss() local
468 no_of_edges != igraph_ecount(graph2)) { in igraph_isomorphic_bliss()
510 IGRAPH_VECTOR_INIT_FINALLY(&from, no_of_edges); in igraph_isomorphic_bliss()
511 IGRAPH_VECTOR_INIT_FINALLY(&to, no_of_edges); in igraph_isomorphic_bliss()
512 IGRAPH_VECTOR_INIT_FINALLY(&index, no_of_edges); in igraph_isomorphic_bliss()
514 IGRAPH_VECTOR_INIT_FINALLY(&to2, no_of_edges); in igraph_isomorphic_bliss()
515 IGRAPH_VECTOR_INIT_FINALLY(&index2, no_of_edges); in igraph_isomorphic_bliss()
517 for (i = 0; i < no_of_edges; i++) { in igraph_isomorphic_bliss()
529 for (i = 0, j = no_of_edges; i < no_of_edges; i++, j++) { in igraph_isomorphic_bliss()
537 igraph_vector_resize(&from2, no_of_edges); in igraph_isomorphic_bliss()
[all …]
/dports/math/igraph/igraph-0.9.5/src/io/
H A Ddimacs.c87 long int no_of_edges = -1; in igraph_read_graph_dimacs() local
130 &no_of_nodes, &no_of_edges); in igraph_read_graph_dimacs()
148 IGRAPH_CHECK(igraph_vector_reserve(capacity, no_of_edges)); in igraph_read_graph_dimacs()
158 IGRAPH_CHECK(igraph_vector_reserve(&edges, no_of_edges * 2)); in igraph_read_graph_dimacs()
279 long int no_of_edges = igraph_ecount(graph); in igraph_write_graph_dimacs() local
284 if (igraph_vector_size(capacity) != no_of_edges) { in igraph_write_graph_dimacs()
294 no_of_nodes, no_of_edges, source + 1, target + 1); in igraph_write_graph_dimacs()
/dports/math/igraph/igraph-0.9.5/src/community/
H A Dmodularity.c122 long int no_of_edges = igraph_ecount(graph); in igraph_modularity() local
138 if (no_of_edges == 0) { in igraph_modularity()
161 if (igraph_vector_size(weights) != no_of_edges) in igraph_modularity()
165 for (i = 0; i < no_of_edges; i++) { in igraph_modularity()
180 m = no_of_edges; in igraph_modularity()
181 for (i = 0; i < no_of_edges; i++) { in igraph_modularity()
306 long int no_of_edges = igraph_ecount(graph); in igraph_modularity_matrix() local
307 igraph_real_t sw = weights ? igraph_vector_sum(weights) : no_of_edges; in igraph_modularity_matrix()
311 if (weights && igraph_vector_size(weights) != no_of_edges) { in igraph_modularity_matrix()
H A Dedge_betweenness.c400 long int no_of_edges = igraph_ecount(graph); in igraph_community_edge_betweenness() local
467 if (igraph_vector_size(weights) != no_of_edges) { in igraph_community_edge_betweenness()
471 if (no_of_edges > 0) { in igraph_community_edge_betweenness()
505 IGRAPH_CHECK(igraph_vector_resize(result, no_of_edges)); in igraph_community_edge_betweenness()
507 IGRAPH_CHECK(igraph_vector_resize(edge_betweenness, no_of_edges)); in igraph_community_edge_betweenness()
508 if (no_of_edges > 0) { in igraph_community_edge_betweenness()
509 VECTOR(*edge_betweenness)[no_of_edges - 1] = 0; in igraph_community_edge_betweenness()
513 IGRAPH_VECTOR_INIT_FINALLY(&eb, no_of_edges); in igraph_community_edge_betweenness()
515 passive = IGRAPH_CALLOC(no_of_edges, char); in igraph_community_edge_betweenness()
527 steps = no_of_edges / 2.0 * (no_of_edges + 1); in igraph_community_edge_betweenness()
[all …]
H A Doptimal_modularity.c91 igraph_integer_t no_of_edges = (igraph_integer_t) igraph_ecount(graph); in igraph_community_optimal_modularity()
105 if (igraph_vector_size(weights) != no_of_edges) { in igraph_community_optimal_modularity()
108 if (no_of_edges > 0) { in igraph_community_optimal_modularity()
135 total_weight = no_of_edges; in igraph_community_optimal_modularity()
142 if (no_of_edges == 0 || total_weight == 0) { in igraph_community_optimal_modularity()
222 for (k = 0; k < no_of_edges; k++) { in igraph_community_optimal_modularity()
/dports/graphics/py-scikit-image/scikit-image-0.19.0/skimage/restoration/
H A Dunwrap_2d_ljmu.c47 int no_of_edges; member
442 int no_of_edges = params->no_of_edges; in horizontalEDGEs() local
455 no_of_edges++; in horizontalEDGEs()
474 no_of_edges++; in horizontalEDGEs()
479 params->no_of_edges = no_of_edges; in horizontalEDGEs()
488 int no_of_edges = params->no_of_edges; in verticalEDGEs() local
490 EDGE *edge_pointer = edge + no_of_edges; in verticalEDGEs()
503 no_of_edges++; in verticalEDGEs()
526 no_of_edges++; in verticalEDGEs()
531 params->no_of_edges = no_of_edges; in verticalEDGEs()
[all …]
/dports/math/igraph/igraph-0.9.5/examples/simple/
H A Digraph_community_edge_betweenness.c35 long int no_of_edges; in test_unweighted() local
65 no_of_edges = igraph_ecount(&g); in test_unweighted()
66 for (i = 0; i < no_of_edges; i++) { in test_unweighted()
71 for (i = 0; i < no_of_edges; i++) { in test_unweighted()
82 for (i = 0; i < no_of_edges; i++) { in test_unweighted()
/dports/math/igraph/igraph-0.9.5/src/flow/
H A Dflow.c186 for (i = 0; i < no_of_edges; i++) { in igraph_i_maxflow_undirected()
202 if (VECTOR(*cut)[i] >= no_of_edges) { in igraph_i_maxflow_undirected()
203 VECTOR(*cut)[i] -= no_of_edges; in igraph_i_maxflow_undirected()
215 for (i = 0; i < no_of_edges; i++) { in igraph_i_maxflow_undirected()
493 igraph_integer_t no_of_edges = 2 * no_of_orig_edges; in igraph_maxflow() local
592 for (i = 0; i < no_of_edges; i += 2) { in igraph_maxflow()
612 for (i = 1; i < no_of_edges; i++) { in igraph_maxflow()
621 VECTOR(first)[idx++] = no_of_edges; in igraph_maxflow()
906 for (i = 0; i < no_of_edges; i += 2) { in igraph_maxflow()
1473 for (i = 0; i < no_of_edges; i++) { in igraph_i_mincut_undirected()
[all …]

12345