Home
last modified time | relevance | path

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

/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
407 long int nlen, minnei = igraph_2wheap_max_index(&Q); in igraph_get_shortest_paths_dijkstra() local
782 long int nlen, minnei = igraph_2wheap_max_index(&Q); in igraph_get_all_shortest_paths_dijkstra() local
H A Dshortest_paths.c219 long int minnei = igraph_2wheap_max_index(&Q); in igraph_i_average_path_length_dijkstra() local
592 long int minnei = igraph_2wheap_max_index(Q); in igraph_i_local_efficiency_dijkstra() local
1186 long int minnei = igraph_2wheap_max_index(&Q); in igraph_diameter_dijkstra() local
/dports/math/igraph/igraph-0.9.5/src/centrality/
H A Dcloseness.c204 igraph_integer_t minnei = (igraph_integer_t) igraph_2wheap_max_index(&Q); in igraph_i_closeness_cutoff_weighted() local
687 igraph_integer_t minnei = (igraph_integer_t) igraph_2wheap_max_index(&Q); in igraph_i_harmonic_centrality_weighted() local
H A Dbetweenness.c145 long int minnei = igraph_2wheap_max_index(&Q); in igraph_i_betweenness_cutoff_weighted() local
618 long int minnei = igraph_2wheap_max_index(&Q); in igraph_i_edge_betweenness_cutoff_weighted() local
/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
/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
2165 long int minnei = igraph_2wheap_max_index(&Q); in igraph_i_edge_betweenness_estimate_weighted() local
2655 igraph_integer_t minnei = (igraph_integer_t) igraph_2wheap_max_index(&Q); in igraph_i_closeness_estimate_weighted() local
H A Dstructural_properties.c4480 long int minnei = igraph_2wheap_max_index(&Q); in igraph_shortest_paths_dijkstra() local
4711 long int nlen, minnei = igraph_2wheap_max_index(&Q); in igraph_get_shortest_paths_dijkstra() local
5076 long int nlen, minnei = igraph_2wheap_max_index(&Q); in igraph_get_all_shortest_paths_dijkstra() local
6367 long int minnei = igraph_2wheap_max_index(&Q); in igraph_diameter_dijkstra() local
H A Dcommunity.c600 long int minnei = igraph_2wheap_max_index(&heap); in igraph_community_edge_betweenness() local