/dports/math/igraph/igraph-0.9.5/src/paths/ |
H A D | dijkstra.c | 198 } else if (altdist < curdist) { in igraph_shortest_paths_dijkstra() 424 igraph_real_t altdist = mindist + VECTOR(*weights)[edge]; in igraph_get_shortest_paths_dijkstra() local 428 VECTOR(dists)[tto] = altdist; in igraph_get_shortest_paths_dijkstra() 431 } else if (altdist < curdist) { in igraph_get_shortest_paths_dijkstra() 433 VECTOR(dists)[tto] = altdist; in igraph_get_shortest_paths_dijkstra() 435 IGRAPH_CHECK(igraph_2wheap_modify(&Q, tto, -altdist)); in igraph_get_shortest_paths_dijkstra() 807 igraph_real_t altdist = mindist + VECTOR(*weights)[edge]; in igraph_get_all_shortest_paths_dijkstra() local 813 VECTOR(dists)[tto] = altdist; in igraph_get_all_shortest_paths_dijkstra() 825 } else if (altdist < curdist) { in igraph_get_all_shortest_paths_dijkstra() 827 VECTOR(dists)[tto] = altdist; in igraph_get_all_shortest_paths_dijkstra() [all …]
|
H A D | shortest_paths.c | 239 igraph_real_t altdist = mindist + VECTOR(*weights)[edge]; in igraph_i_average_path_length_dijkstra() local 245 IGRAPH_CHECK(igraph_2wheap_push_with_index(&Q, tto, -altdist)); in igraph_i_average_path_length_dijkstra() 246 } else if (altdist < curdist) { in igraph_i_average_path_length_dijkstra() 248 IGRAPH_CHECK(igraph_2wheap_modify(&Q, tto, -altdist)); in igraph_i_average_path_length_dijkstra() 610 igraph_real_t altdist, curdist; in igraph_i_local_efficiency_dijkstra() local 618 altdist = mindist + VECTOR(*weights)[edge]; in igraph_i_local_efficiency_dijkstra() 625 } else if (altdist < curdist) { in igraph_i_local_efficiency_dijkstra() 627 IGRAPH_CHECK(igraph_2wheap_modify(Q, tto, -altdist)); in igraph_i_local_efficiency_dijkstra() 1202 igraph_real_t altdist = mindist + VECTOR(*weights)[edge]; in igraph_diameter_dijkstra() local 1210 } else if (altdist < curdist) { in igraph_diameter_dijkstra() [all …]
|
/dports/math/igraph/igraph-0.9.5/src/centrality/ |
H A D | closeness.c | 221 igraph_real_t altdist = mindist + VECTOR(*weights)[edge]; in igraph_i_closeness_cutoff_weighted() local 227 VECTOR(dist)[to] = altdist; in igraph_i_closeness_cutoff_weighted() 228 IGRAPH_CHECK(igraph_2wheap_push_with_index(&Q, to, -altdist)); in igraph_i_closeness_cutoff_weighted() 229 } else if (curdist == 0 /* this means curdist is infinity */ || altdist < curdist) { in igraph_i_closeness_cutoff_weighted() 231 VECTOR(dist)[to] = altdist; in igraph_i_closeness_cutoff_weighted() 232 IGRAPH_CHECK(igraph_2wheap_modify(&Q, to, -altdist)); in igraph_i_closeness_cutoff_weighted() 706 igraph_real_t altdist = mindist + VECTOR(*weights)[edge]; in igraph_i_harmonic_centrality_weighted() local 712 VECTOR(dist)[to] = altdist; in igraph_i_harmonic_centrality_weighted() 713 IGRAPH_CHECK(igraph_2wheap_push_with_index(&Q, to, -altdist)); in igraph_i_harmonic_centrality_weighted() 716 VECTOR(dist)[to] = altdist; in igraph_i_harmonic_centrality_weighted() [all …]
|
H A D | betweenness.c | 168 igraph_real_t altdist = mindist + VECTOR(*weights)[edge]; in igraph_i_betweenness_cutoff_weighted() local 175 cmp_result = igraph_cmp_epsilon(altdist, curdist, eps); in igraph_i_betweenness_cutoff_weighted() 185 VECTOR(dist)[to] = altdist; in igraph_i_betweenness_cutoff_weighted() 194 VECTOR(dist)[to] = altdist; in igraph_i_betweenness_cutoff_weighted() 195 IGRAPH_CHECK(igraph_2wheap_modify(&Q, to, -altdist)); in igraph_i_betweenness_cutoff_weighted() 197 (altdist <= cutoff + 1.0 || cutoff < 0)) { in igraph_i_betweenness_cutoff_weighted() 643 igraph_real_t altdist = mindist + VECTOR(*weights)[edge]; in igraph_i_edge_betweenness_cutoff_weighted() local 662 VECTOR(distance)[to] = altdist; in igraph_i_edge_betweenness_cutoff_weighted() 671 VECTOR(distance)[to] = altdist; in igraph_i_edge_betweenness_cutoff_weighted() 672 IGRAPH_CHECK(igraph_2wheap_modify(&Q, to, -altdist)); in igraph_i_edge_betweenness_cutoff_weighted() [all …]
|
/dports/math/igraph/igraph-0.9.5/src/community/ |
H A D | edge_betweenness.c | 633 igraph_real_t altdist = mindist + VECTOR(*weights)[edge]; in igraph_community_edge_betweenness() local 643 distance[to] = altdist + 1.0; in igraph_community_edge_betweenness() 644 IGRAPH_CHECK(igraph_2wheap_push_with_index(&heap, to, -altdist)); in igraph_community_edge_betweenness() 645 } else if (altdist < curdist - 1) { in igraph_community_edge_betweenness() 651 distance[to] = altdist + 1.0; in igraph_community_edge_betweenness() 652 IGRAPH_CHECK(igraph_2wheap_modify(&heap, to, -altdist)); in igraph_community_edge_betweenness() 653 } else if (altdist == curdist - 1) { in igraph_community_edge_betweenness()
|
/dports/math/R-cran-igraph/igraph/src/ |
H A D | centrality.c | 1690 igraph_real_t altdist = mindist + VECTOR(*weights)[edge]; in igraph_i_betweenness_estimate_weighted() local 1707 VECTOR(dist)[to] = altdist; in igraph_i_betweenness_estimate_weighted() 1716 VECTOR(dist)[to] = altdist; in igraph_i_betweenness_estimate_weighted() 1717 IGRAPH_CHECK(igraph_2wheap_modify(&Q, to, -altdist)); in igraph_i_betweenness_estimate_weighted() 1719 (altdist <= cutoff + 1.0 || cutoff < 0)) { in igraph_i_betweenness_estimate_weighted() 2184 igraph_real_t altdist = mindist + VECTOR(*weights)[edge]; in igraph_i_edge_betweenness_estimate_weighted() local 2203 VECTOR(distance)[to] = altdist; in igraph_i_edge_betweenness_estimate_weighted() 2212 VECTOR(distance)[to] = altdist; in igraph_i_edge_betweenness_estimate_weighted() 2213 IGRAPH_CHECK(igraph_2wheap_modify(&Q, to, -altdist)); in igraph_i_edge_betweenness_estimate_weighted() 2684 VECTOR(dist)[to] = altdist; in igraph_i_closeness_estimate_weighted() [all …]
|
H A D | structural_properties.c | 4511 } else if (altdist < curdist) { in igraph_shortest_paths_dijkstra() 4728 igraph_real_t altdist = mindist + VECTOR(*weights)[edge]; in igraph_get_shortest_paths_dijkstra() local 4732 VECTOR(dists)[tto] = altdist; in igraph_get_shortest_paths_dijkstra() 4735 } else if (altdist < curdist) { in igraph_get_shortest_paths_dijkstra() 4737 VECTOR(dists)[tto] = altdist; in igraph_get_shortest_paths_dijkstra() 4739 IGRAPH_CHECK(igraph_2wheap_modify(&Q, tto, -altdist)); in igraph_get_shortest_paths_dijkstra() 5101 igraph_real_t altdist = mindist + VECTOR(*weights)[edge]; in igraph_get_all_shortest_paths_dijkstra() local 5107 VECTOR(dists)[tto] = altdist; in igraph_get_all_shortest_paths_dijkstra() 5119 } else if (altdist < curdist) { in igraph_get_all_shortest_paths_dijkstra() 5121 VECTOR(dists)[tto] = altdist; in igraph_get_all_shortest_paths_dijkstra() [all …]
|
H A D | community.c | 611 igraph_real_t altdist = mindist + VECTOR(*weights)[edge]; in igraph_community_edge_betweenness() local 621 distance[to] = altdist + 1.0; in igraph_community_edge_betweenness() 622 IGRAPH_CHECK(igraph_2wheap_push_with_index(&heap, to, -altdist)); in igraph_community_edge_betweenness() 623 } else if (altdist < curdist - 1) { in igraph_community_edge_betweenness() 629 distance[to] = altdist + 1.0; in igraph_community_edge_betweenness() 630 IGRAPH_CHECK(igraph_2wheap_modify(&heap, to, -altdist)); in igraph_community_edge_betweenness() 631 } else if (altdist == curdist - 1) { in igraph_community_edge_betweenness()
|
/dports/games/hyperrogue/hyperrogue-12.0f/ |
H A D | reg3.cpp | 100 inline short& altdist(heptagon *h) { return h->emeraldval; } in altdist() function 1376 if(altdist(h) > altdist(h2) + 1) { in fix_distances() 1377 altdist(h) = altdist(h2) + 1; in fix_distances() 1380 else if (altdist(h2) > altdist(h) + 1) { in fix_distances() 1381 altdist(h2) = altdist(h) + 1; in fix_distances() 1524 altdist(h) = 0; in link_alt() 1535 altdist(hs.at) = altdist(h) - 1; in extend_altmap() 1544 altdist(h2) = altdist(h) + 1; in extend_altmap()
|
H A D | cell.cpp | 570 return reg3::altdist(c->master); in celldistAlt()
|
H A D | bigstuff.cpp | 1837 if(WDIM == 3 && hyperbolic && !reg3::in_rule()) return reg3::altdist(c->master); in masterAlt()
|