| /dports/math/igraph/igraph-0.9.5/src/properties/ |
| H A D | neighborhood.c | 115 long int actdist = (long int) igraph_dqueue_pop(&q); in igraph_neighborhood_size() local
250 long int actdist = (long int) igraph_dqueue_pop(&q); in igraph_neighborhood() local
397 long int actdist = (long int) igraph_dqueue_pop(&q); in igraph_neighborhood_graphs() local
|
| H A D | convergence_degree.c | 131 long int actdist = (long int) igraph_dqueue_pop(&q); in igraph_convergence_degree() local
|
| /dports/math/igraph/igraph-0.9.5/src/operators/ |
| H A D | connect_neighborhood.c | 108 long int actdist = (long int) igraph_dqueue_pop(&q); in igraph_connect_neighborhood() local
|
| /dports/math/igraph/igraph-0.9.5/src/paths/ |
| H A D | histogram.c | 101 long int actdist = (long int) igraph_dqueue_pop(&q); in igraph_path_length_hist() local
|
| H A D | all_shortest_paths.c | 193 long int actdist = (long int) igraph_dqueue_pop(&q); in igraph_get_all_shortest_paths() local
|
| H A D | shortest_paths.c | 82 long int actdist = (long int) igraph_dqueue_pop(&q); in igraph_i_average_path_length_unweighted() local
492 long int actdist = (long int) igraph_dqueue_pop(q); in igraph_i_local_efficiency_unweighted() local
990 long int actdist = (long int) igraph_dqueue_pop(&q); in igraph_diameter() local
|
| H A D | unweighted.c | 147 long int actdist = (long int) igraph_dqueue_pop(&q); in igraph_shortest_paths() local
|
| /dports/math/igraph/igraph-0.9.5/src/graph/ |
| H A D | visitors.c | 223 long int actdist = (long int) igraph_dqueue_pop(&Q); in igraph_bfs() local
386 long int actdist = (long int) igraph_dqueue_pop(&q); in igraph_bfs_simple() local
|
| /dports/math/R-cran-igraph/igraph/src/ |
| H A D | visitors.c | 220 long int actdist = (long int) igraph_dqueue_pop(&Q); in igraph_bfs() local
340 long int actdist = (long int) igraph_dqueue_pop(&q); in igraph_i_bfs() local
|
| H A D | structural_properties.c | 136 long int actdist = (long int) igraph_dqueue_pop(&q); in igraph_diameter() local
268 long int actdist = (long int) igraph_dqueue_pop(&q); in igraph_average_path_length() local
378 long int actdist = (long int) igraph_dqueue_pop(&q); in igraph_path_length_hist() local
547 long int actdist = (long int) igraph_dqueue_pop(&q); in igraph_shortest_paths() local
1100 long int actdist = (long int) igraph_dqueue_pop(&q); in igraph_get_all_shortest_paths() local
3043 long int actdist = (long int) igraph_dqueue_pop(&q); in igraph_neighborhood_size() local
3176 long int actdist = (long int) igraph_dqueue_pop(&q); in igraph_neighborhood() local
3321 long int actdist = (long int) igraph_dqueue_pop(&q); in igraph_neighborhood_graphs() local
4280 long int actdist = (long int) igraph_dqueue_pop(&q); in igraph_convergence_degree() local
|
| H A D | structure_generators.c | 1382 long int actdist = (long int) igraph_dqueue_pop(&q); in igraph_connect_neighborhood() local
|
| H A D | flow.c | 752 long int actdist = (long int) igraph_dqueue_pop(&Q); in igraph_maxflow() local
|
| H A D | layout.c | 838 long int actdist = (long int) igraph_dqueue_pop(&q); in igraph_i_layout_reingold_tilford() local
|
| H A D | centrality.c | 2798 long int actdist; in igraph_closeness_estimate() local
|
| /dports/math/igraph/igraph-0.9.5/src/centrality/ |
| H A D | closeness.c | 418 long int actdist = 0; in igraph_closeness_cutoff() local
538 long int actdist = 0; in igraph_i_harmonic_centrality_unweighted() local
|
| /dports/cad/calculix-ccx/CalculiX/ccx_2.18/src/ |
| H A D | transition.f | 37 & scale,actdist,dd,xrefnode,yrefnode,zrefnode local
|
| H A D | thickness.f | 35 & actdist,dd,xrefnode,yrefnode,zrefnode, local
|
| /dports/math/igraph/igraph-0.9.5/src/layout/ |
| H A D | reingold_tilford.c | 179 long int actdist = (long int) igraph_dqueue_pop(&q); in igraph_i_layout_reingold_tilford() local
|
| /dports/math/igraph/igraph-0.9.5/src/flow/ |
| H A D | flow.c | 765 long int actdist = (long int) igraph_dqueue_pop(&Q); in igraph_maxflow() local
|
| /dports/science/liggghts/LIGGGHTS-PUBLIC-3.8.0-26-g6e873439/lib/hotint/HotInt_V1/ServiceObjectsLib/ |
| H A D | GeomElements.cpp | 3131 double actdist = MinDistTP(p1,p2,p3, pp); in PointIsInside() local
|