Home
last modified time | relevance | path

Searched defs:altdist (Results 1 – 9 of 9) sorted by relevance

/dports/math/igraph/igraph-0.9.5/src/paths/
H A Ddijkstra.c191 igraph_real_t altdist = mindist + VECTOR(*weights)[edge]; in igraph_shortest_paths_dijkstra() local
424 igraph_real_t altdist = mindist + VECTOR(*weights)[edge]; in igraph_get_shortest_paths_dijkstra() local
807 igraph_real_t altdist = mindist + VECTOR(*weights)[edge]; in igraph_get_all_shortest_paths_dijkstra() local
H A Dshortest_paths.c239 igraph_real_t altdist = mindist + VECTOR(*weights)[edge]; in igraph_i_average_path_length_dijkstra() local
610 igraph_real_t altdist, curdist; in igraph_i_local_efficiency_dijkstra() local
1202 igraph_real_t altdist = mindist + VECTOR(*weights)[edge]; in igraph_diameter_dijkstra() local
/dports/math/igraph/igraph-0.9.5/src/centrality/
H A Dcloseness.c221 igraph_real_t altdist = mindist + VECTOR(*weights)[edge]; in igraph_i_closeness_cutoff_weighted() local
706 igraph_real_t altdist = mindist + VECTOR(*weights)[edge]; in igraph_i_harmonic_centrality_weighted() local
H A Dbetweenness.c168 igraph_real_t altdist = mindist + VECTOR(*weights)[edge]; in igraph_i_betweenness_cutoff_weighted() local
643 igraph_real_t altdist = mindist + VECTOR(*weights)[edge]; in igraph_i_edge_betweenness_cutoff_weighted() local
/dports/math/igraph/igraph-0.9.5/src/community/
H A Dedge_betweenness.c633 igraph_real_t altdist = mindist + VECTOR(*weights)[edge]; in igraph_community_edge_betweenness() local
/dports/math/R-cran-igraph/igraph/src/
H A Dcentrality.c1690 igraph_real_t altdist = mindist + VECTOR(*weights)[edge]; in igraph_i_betweenness_estimate_weighted() local
2184 igraph_real_t altdist = mindist + VECTOR(*weights)[edge]; in igraph_i_edge_betweenness_estimate_weighted() local
2672 igraph_real_t altdist = mindist + VECTOR(*weights)[edge]; in igraph_i_closeness_estimate_weighted() local
H A Dstructural_properties.c4504 igraph_real_t altdist = mindist + VECTOR(*weights)[edge]; in igraph_shortest_paths_dijkstra() local
4728 igraph_real_t altdist = mindist + VECTOR(*weights)[edge]; in igraph_get_shortest_paths_dijkstra() local
5101 igraph_real_t altdist = mindist + VECTOR(*weights)[edge]; in igraph_get_all_shortest_paths_dijkstra() local
6383 igraph_real_t altdist = mindist + VECTOR(*weights)[edge]; in igraph_diameter_dijkstra() local
H A Dcommunity.c611 igraph_real_t altdist = mindist + VECTOR(*weights)[edge]; in igraph_community_edge_betweenness() local
/dports/games/hyperrogue/hyperrogue-12.0f/
H A Dreg3.cpp100 inline short& altdist(heptagon *h) { return h->emeraldval; } in altdist() function