Home
last modified time | relevance | path

Searched refs:minnei (Results 1 – 8 of 8) sorted by relevance

/dports/math/igraph/igraph-0.9.5/src/centrality/
H A Dbetweenness.c153 VECTOR(tmpscore)[minnei] = 0; in igraph_i_betweenness_cutoff_weighted()
154 VECTOR(dist)[minnei] = 0; in igraph_i_betweenness_cutoff_weighted()
155 VECTOR(nrgeo)[minnei] = 0; in igraph_i_betweenness_cutoff_weighted()
160 igraph_stack_push(&S, minnei); in igraph_i_betweenness_cutoff_weighted()
163 neis = igraph_inclist_get(&inclist, minnei); in igraph_i_betweenness_cutoff_weighted()
182 VECTOR(*v)[0] = minnei; in igraph_i_betweenness_cutoff_weighted()
191 VECTOR(*v)[0] = minnei; in igraph_i_betweenness_cutoff_weighted()
629 VECTOR(tmpscore)[minnei] = 0; in igraph_i_edge_betweenness_cutoff_weighted()
630 VECTOR(distance)[minnei] = 0; in igraph_i_edge_betweenness_cutoff_weighted()
631 VECTOR(nrgeo)[minnei] = 0; in igraph_i_edge_betweenness_cutoff_weighted()
[all …]
H A Dcloseness.c204 igraph_integer_t minnei = (igraph_integer_t) igraph_2wheap_max_index(&Q); in igraph_i_closeness_cutoff_weighted() local
206 igraph_vector_int_t *neis = igraph_lazy_inclist_get(&inclist, minnei); in igraph_i_closeness_cutoff_weighted()
220 long int to = IGRAPH_OTHER(graph, edge, minnei); in igraph_i_closeness_cutoff_weighted()
687 igraph_integer_t minnei = (igraph_integer_t) igraph_2wheap_max_index(&Q); in igraph_i_harmonic_centrality_weighted() local
689 igraph_vector_int_t *neis = igraph_lazy_inclist_get(&inclist, minnei); in igraph_i_harmonic_centrality_weighted()
699 if (source != minnei) { in igraph_i_harmonic_centrality_weighted()
705 long int to = IGRAPH_OTHER(graph, edge, minnei); in igraph_i_harmonic_centrality_weighted()
/dports/math/igraph/igraph-0.9.5/src/paths/
H A Ddijkstra.c167 long int minnei = igraph_2wheap_max_index(&Q); in igraph_shortest_paths_dijkstra() local
173 MATRIX(*res, i, minnei) = mindist - 1.0; in igraph_shortest_paths_dijkstra()
175 if (VECTOR(indexv)[minnei]) { in igraph_shortest_paths_dijkstra()
407 long int nlen, minnei = igraph_2wheap_max_index(&Q); in igraph_get_shortest_paths_dijkstra() local
413 if (is_target[minnei]) { in igraph_get_shortest_paths_dijkstra()
414 is_target[minnei] = 0; in igraph_get_shortest_paths_dijkstra()
423 long int tto = IGRAPH_OTHER(graph, edge, minnei); in igraph_get_shortest_paths_dijkstra()
782 long int nlen, minnei = igraph_2wheap_max_index(&Q); in igraph_get_all_shortest_paths_dijkstra() local
793 if (is_target[minnei]) { in igraph_get_all_shortest_paths_dijkstra()
794 is_target[minnei] = 0; in igraph_get_all_shortest_paths_dijkstra()
[all …]
H A Dshortest_paths.c219 long int minnei = igraph_2wheap_max_index(&Q); in igraph_i_average_path_length_dijkstra() local
224 if (minnei != source) { in igraph_i_average_path_length_dijkstra()
234 neis = igraph_lazy_inclist_get(&inclist, (igraph_integer_t) minnei); in igraph_i_average_path_length_dijkstra()
238 long int tto = IGRAPH_OTHER(graph, edge, minnei); in igraph_i_average_path_length_dijkstra()
592 long int minnei = igraph_2wheap_max_index(Q); in igraph_i_local_efficiency_dijkstra() local
597 if (minnei != source && VECTOR(*nei_mask)[minnei]) { in igraph_i_local_efficiency_dijkstra()
613 long int tto = IGRAPH_OTHER(graph, edge, minnei); in igraph_i_local_efficiency_dijkstra()
1186 long int minnei = igraph_2wheap_max_index(&Q); in igraph_diameter_dijkstra() local
1192 res = mindist; from = source; to = minnei; in igraph_diameter_dijkstra()
1197 neis = igraph_inclist_get(&inclist, minnei); in igraph_diameter_dijkstra()
[all …]
/dports/math/R-cran-igraph/igraph/src/
H A Dcentrality.c1667 long int minnei = igraph_2wheap_max_index(&Q); in igraph_i_betweenness_estimate_weighted() local
1675 VECTOR(tmpscore)[minnei] = 0; in igraph_i_betweenness_estimate_weighted()
1676 VECTOR(dist)[minnei] = 0; in igraph_i_betweenness_estimate_weighted()
1677 VECTOR(nrgeo)[minnei] = 0; in igraph_i_betweenness_estimate_weighted()
1682 igraph_stack_push(&S, minnei); in igraph_i_betweenness_estimate_weighted()
1685 neis = igraph_inclist_get(&inclist, minnei); in igraph_i_betweenness_estimate_weighted()
1704 VECTOR(*v)[0] = minnei; in igraph_i_betweenness_estimate_weighted()
1713 VECTOR(*v)[0] = minnei; in igraph_i_betweenness_estimate_weighted()
2165 long int minnei = igraph_2wheap_max_index(&Q); in igraph_i_edge_betweenness_estimate_weighted() local
2173 igraph_stack_push(&S, minnei); in igraph_i_edge_betweenness_estimate_weighted()
[all …]
H A Dstructural_properties.c4480 long int minnei = igraph_2wheap_max_index(&Q); in igraph_shortest_paths_dijkstra() local
4486 MATRIX(*res, i, minnei) = mindist - 1.0; in igraph_shortest_paths_dijkstra()
4488 if (VECTOR(indexv)[minnei]) { in igraph_shortest_paths_dijkstra()
4711 long int nlen, minnei = igraph_2wheap_max_index(&Q); in igraph_get_shortest_paths_dijkstra() local
4717 if (is_target[minnei]) { in igraph_get_shortest_paths_dijkstra()
4718 is_target[minnei] = 0; in igraph_get_shortest_paths_dijkstra()
5087 if (is_target[minnei]) { in igraph_get_all_shortest_paths_dijkstra()
5088 is_target[minnei] = 0; in igraph_get_all_shortest_paths_dijkstra()
6367 long int minnei = igraph_2wheap_max_index(&Q); in igraph_diameter_dijkstra() local
6373 res = mindist; from = source; to = minnei; in igraph_diameter_dijkstra()
[all …]
H A Dcommunity.c600 long int minnei = igraph_2wheap_max_index(&heap); in igraph_community_edge_betweenness() local
603 igraph_stack_push(&stack, minnei); in igraph_community_edge_betweenness()
605 neip = igraph_inclist_get(elist_out_p, minnei); in igraph_community_edge_betweenness()
610 long int to = IGRAPH_OTHER(graph, edge, minnei); in igraph_community_edge_betweenness()
620 nrgeo[to] = nrgeo[minnei]; in igraph_community_edge_betweenness()
628 nrgeo[to] = nrgeo[minnei]; in igraph_community_edge_betweenness()
635 nrgeo[to] += nrgeo[minnei]; in igraph_community_edge_betweenness()
/dports/math/igraph/igraph-0.9.5/src/community/
H A Dedge_betweenness.c622 long int minnei = igraph_2wheap_max_index(&heap); in igraph_community_edge_betweenness() local
625 igraph_stack_push(&stack, minnei); in igraph_community_edge_betweenness()
627 neip = igraph_inclist_get(elist_out_p, minnei); in igraph_community_edge_betweenness()
632 long int to = IGRAPH_OTHER(graph, edge, minnei); in igraph_community_edge_betweenness()
642 nrgeo[to] = nrgeo[minnei]; in igraph_community_edge_betweenness()
650 nrgeo[to] = nrgeo[minnei]; in igraph_community_edge_betweenness()
657 nrgeo[to] += nrgeo[minnei]; in igraph_community_edge_betweenness()