Home
last modified time | relevance | path

Searched refs:nodes_reached (Results 1 – 5 of 5) sorted by relevance

/dports/math/igraph/igraph-0.9.5/src/centrality/
H A Dcloseness.c152 long int nodes_reached; in igraph_i_closeness_cutoff_weighted() local
201 nodes_reached = 0; in igraph_i_closeness_cutoff_weighted()
216 nodes_reached++; in igraph_i_closeness_cutoff_weighted()
239 VECTOR(*reachable_count)[i] = nodes_reached - 1; in igraph_i_closeness_cutoff_weighted()
244 …VECTOR(*res)[i] = VECTOR(*res)[i] == 0 ? IGRAPH_NAN : ((igraph_real_t) (nodes_reached-1)) / VECTOR… in igraph_i_closeness_cutoff_weighted()
251 if (nodes_reached < no_of_nodes) { in igraph_i_closeness_cutoff_weighted()
415 long int nodes_reached; in igraph_closeness_cutoff() local
459 nodes_reached = 0; in igraph_closeness_cutoff()
478 nodes_reached++; in igraph_closeness_cutoff()
494 VECTOR(*reachable_count)[i] = nodes_reached - 1; in igraph_closeness_cutoff()
[all …]
/dports/math/igraph/igraph-0.9.5/src/paths/
H A Dhistogram.c65 long int nodes_reached; in igraph_path_length_hist() local
90 nodes_reached = 1; /* itself */ in igraph_path_length_hist()
111 nodes_reached++; in igraph_path_length_hist()
125 unconn += (no_of_nodes - nodes_reached); in igraph_path_length_hist()
H A Dshortest_paths.c936 long int nodes_reached; in igraph_diameter() local
979 nodes_reached = 1; in igraph_diameter()
1005 nodes_reached++; in igraph_diameter()
1012 if (nodes_reached != no_of_nodes && !unconn) { in igraph_diameter()
1127 long int nodes_reached = 0; in igraph_diameter_dijkstra() local
1183 nodes_reached = 0.0; in igraph_diameter_dijkstra()
1194 nodes_reached++; in igraph_diameter_dijkstra()
1219 if (nodes_reached != no_of_nodes && !unconn) { in igraph_diameter_dijkstra()
/dports/math/R-cran-igraph/igraph/src/
H A Dcentrality.c2609 long int nodes_reached; in igraph_i_closeness_estimate_weighted() local
2652 nodes_reached = 0; in igraph_i_closeness_estimate_weighted()
2663 nodes_reached++; in igraph_i_closeness_estimate_weighted()
2696 VECTOR(*res)[i] += ((igraph_real_t)no_of_nodes * (no_of_nodes - nodes_reached)); in igraph_i_closeness_estimate_weighted()
2700 nodes_reached < no_of_nodes && !warning_shown) { in igraph_i_closeness_estimate_weighted()
2797 long int nodes_reached; in igraph_closeness_estimate() local
2838 nodes_reached = 1; in igraph_closeness_estimate()
2862 nodes_reached++; in igraph_closeness_estimate()
2869 VECTOR(*res)[i] += ((igraph_real_t)no_of_nodes * (no_of_nodes - nodes_reached)); in igraph_closeness_estimate()
2873 no_of_nodes > nodes_reached && !warning_shown) { in igraph_closeness_estimate()
H A Dstructural_properties.c100 long int nodes_reached; in igraph_diameter() local
125 nodes_reached = 1; in igraph_diameter()
151 nodes_reached++; in igraph_diameter()
234 long int nodes_reached = 0; in igraph_average_path_length() local
259 nodes_reached = 0; in igraph_average_path_length()
278 nodes_reached++; in igraph_average_path_length()
342 long int nodes_reached; in igraph_path_length_hist() local
388 nodes_reached++; in igraph_path_length_hist()
6332 long int nodes_reached = 0; in igraph_diameter_dijkstra() local
6364 nodes_reached = 0.0; in igraph_diameter_dijkstra()
[all …]