Home
last modified time | relevance | path

Searched refs:actdist (Results 1 – 20 of 20) sorted by relevance

/dports/math/igraph/igraph-0.9.5/src/properties/
H A Dneighborhood.c115 long int actdist = (long int) igraph_dqueue_pop(&q); in igraph_neighborhood_size() local
120 if (actdist < order - 1) { in igraph_neighborhood_size()
128 if (actdist + 1 >= mindist) { in igraph_neighborhood_size()
139 if (actdist + 1 >= mindist) { in igraph_neighborhood_size()
250 long int actdist = (long int) igraph_dqueue_pop(&q); in igraph_neighborhood() local
255 if (actdist < order - 1) { in igraph_neighborhood()
263 if (actdist + 1 >= mindist) { in igraph_neighborhood()
274 if (actdist + 1 >= mindist) { in igraph_neighborhood()
402 if (actdist < order - 1) { in igraph_neighborhood_graphs()
410 if (actdist + 1 >= mindist) { in igraph_neighborhood_graphs()
[all …]
H A Dconvergence_degree.c131 long int actdist = (long int) igraph_dqueue_pop(&q); in igraph_convergence_degree() local
139 if (geodist[neighbor] - 1 == actdist + 1) { in igraph_convergence_degree()
151 } else if (geodist[neighbor] - 1 < actdist + 1) { in igraph_convergence_degree()
157 IGRAPH_CHECK(igraph_dqueue_push(&q, actdist + 1)); in igraph_convergence_degree()
169 geodist[neighbor] = actdist + 2; in igraph_convergence_degree()
/dports/math/igraph/igraph-0.9.5/src/paths/
H A Dhistogram.c101 long int actdist = (long int) igraph_dqueue_pop(&q); in igraph_path_length_hist() local
112 if (actdist + 1 > ressize) { in igraph_path_length_hist()
113 IGRAPH_CHECK(igraph_vector_resize(res, actdist + 1)); in igraph_path_length_hist()
114 for (; ressize < actdist + 1; ressize++) { in igraph_path_length_hist()
118 VECTOR(*res)[actdist] += 1; in igraph_path_length_hist()
121 IGRAPH_CHECK(igraph_dqueue_push(&q, actdist + 1)); in igraph_path_length_hist()
H A Dall_shortest_paths.c193 long int actdist = (long int) igraph_dqueue_pop(&q); in igraph_get_all_shortest_paths() local
202 if (actdist > maxdist) { in igraph_get_all_shortest_paths()
220 geodist[neighbor] - 1 < actdist + 1) { in igraph_get_all_shortest_paths()
235 IGRAPH_CHECK(igraph_dqueue_push(&q, actdist + 1)); in igraph_get_all_shortest_paths()
240 maxdist = actdist; in igraph_get_all_shortest_paths()
243 geodist[neighbor] = actdist + 2; in igraph_get_all_shortest_paths()
252 IGRAPH_CHECK(igraph_vector_reserve(vptr, actdist + 2)); in igraph_get_all_shortest_paths()
H A Dshortest_paths.c82 long int actdist = (long int) igraph_dqueue_pop(&q); in igraph_i_average_path_length_unweighted() local
93 *res += 1.0/(actdist + 1.0); in igraph_i_average_path_length_unweighted()
95 *res += actdist + 1.0; in igraph_i_average_path_length_unweighted()
99 IGRAPH_CHECK(igraph_dqueue_push(&q, actdist + 1)); in igraph_i_average_path_length_unweighted()
492 long int actdist = (long int) igraph_dqueue_pop(q); in igraph_i_local_efficiency_unweighted() local
495 *res += 1.0 / actdist; in igraph_i_local_efficiency_unweighted()
513 IGRAPH_CHECK(igraph_dqueue_push(q, actdist + 1)); in igraph_i_local_efficiency_unweighted()
990 long int actdist = (long int) igraph_dqueue_pop(&q); in igraph_diameter() local
991 if (actdist > res) { in igraph_diameter()
992 res = actdist; in igraph_diameter()
[all …]
H A Dunweighted.c147 long int actdist = (long int) igraph_dqueue_pop(&q); in igraph_shortest_paths() local
150 MATRIX(*res, i, act) = actdist; in igraph_shortest_paths()
153 MATRIX(*res, i, (long int)(VECTOR(indexv)[act] - 1)) = actdist; in igraph_shortest_paths()
170 IGRAPH_CHECK(igraph_dqueue_push(&q, actdist + 1)); in igraph_shortest_paths()
/dports/cad/calculix-ccx/CalculiX/ccx_2.18/src/
H A Dthickness.f35 & actdist,dd,xrefnode,yrefnode,zrefnode, local
71 actdist=dsqrt(dd)
83 dgdxglob(1,iactnode,iobject)=actdist
85 if(actdist.gt.refdist) then
93 if(actdist.lt.refdist) then
H A Dtransition.f37 & scale,actdist,dd,xrefnode,yrefnode,zrefnode local
63 actdist=dsqrt(dd)
64 if(actdist.ge.trans) cycle
67 scale=actdist/trans
/dports/math/R-cran-igraph/igraph/src/
H A Dvisitors.c220 long int actdist = (long int) igraph_dqueue_pop(&Q); in igraph_bfs() local
236 VECTOR(*dist)[actvect] = actdist; in igraph_bfs()
244 IGRAPH_CHECK(igraph_dqueue_push(&Q, actdist + 1)); in igraph_bfs()
257 (igraph_integer_t) act_rank - 1, (igraph_integer_t) actdist, in igraph_bfs()
340 long int actdist = (long int) igraph_dqueue_pop(&q); in igraph_i_bfs() local
349 IGRAPH_CHECK(igraph_dqueue_push(&q, actdist + 1)); in igraph_i_bfs()
350 if (lastlayer != actdist + 1) { in igraph_i_bfs()
354 lastlayer = actdist + 1; in igraph_i_bfs()
H A Dstructural_properties.c137 if (actdist > res) { in igraph_diameter()
138 res = actdist; in igraph_diameter()
279 *res += actdist + 1; in igraph_average_path_length()
389 if (actdist + 1 > ressize) { in igraph_path_length_hist()
395 VECTOR(*res)[actdist] += 1; in igraph_path_length_hist()
1109 if (actdist > maxdist) { in igraph_get_all_shortest_paths()
1147 maxdist = actdist; in igraph_get_all_shortest_paths()
1150 geodist[neighbor] = actdist + 2; in igraph_get_all_shortest_paths()
3048 if (actdist < order - 1) { in igraph_neighborhood_size()
3181 if (actdist < order - 1) { in igraph_neighborhood()
[all …]
H A Dcentrality.c2798 long int actdist; in igraph_closeness_estimate() local
2846 actdist = (long int) igraph_dqueue_pop(&q); in igraph_closeness_estimate()
2848 VECTOR(*res)[i] += actdist; in igraph_closeness_estimate()
2850 if (cutoff > 0 && actdist >= cutoff) { in igraph_closeness_estimate()
2864 IGRAPH_CHECK(igraph_dqueue_push(&q, actdist + 1)); in igraph_closeness_estimate()
2872 if (((cutoff > 0 && actdist < cutoff) || cutoff <= 0) && in igraph_closeness_estimate()
H A Dstructure_generators.c1382 long int actdist = (long int) igraph_dqueue_pop(&q); in igraph_connect_neighborhood() local
1387 if (actdist < order - 1) { in igraph_connect_neighborhood()
1393 IGRAPH_CHECK(igraph_dqueue_push(&q, actdist + 1)); in igraph_connect_neighborhood()
H A Dlayout.c838 long int actdist = (long int) igraph_dqueue_pop(&q); in igraph_i_layout_reingold_tilford() local
847 MATRIX(*res, neighbor, 1) = actdist + 1; in igraph_i_layout_reingold_tilford()
849 IGRAPH_CHECK(igraph_dqueue_push(&q, actdist + 1)); in igraph_i_layout_reingold_tilford()
851 vdata[neighbor].level = actdist + 1; in igraph_i_layout_reingold_tilford()
H A Dflow.c752 long int actdist = (long int) igraph_dqueue_pop(&Q); in igraph_maxflow() local
753 DIST(actnode) = actdist; in igraph_maxflow()
760 IGRAPH_CHECK(igraph_dqueue_push(&Q, actdist + 1)); in igraph_maxflow()
/dports/math/igraph/igraph-0.9.5/src/centrality/
H A Dcloseness.c418 long int actdist = 0; in igraph_closeness_cutoff() local
471 actdist = (long int) igraph_dqueue_pop(&q); in igraph_closeness_cutoff()
473 if (cutoff >= 0 && actdist > cutoff) { in igraph_closeness_cutoff()
477 VECTOR(*res)[i] += actdist; in igraph_closeness_cutoff()
489 IGRAPH_CHECK(igraph_dqueue_push(&q, actdist + 1)); in igraph_closeness_cutoff()
538 long int actdist = 0; in igraph_i_harmonic_centrality_unweighted() local
580 actdist = (long int) igraph_dqueue_pop(&q); in igraph_i_harmonic_centrality_unweighted()
582 if (cutoff >= 0 && actdist > cutoff) { in igraph_i_harmonic_centrality_unweighted()
588 VECTOR(*res)[i] += 1.0/actdist; in igraph_i_harmonic_centrality_unweighted()
600 IGRAPH_CHECK(igraph_dqueue_push(&q, actdist + 1)); in igraph_i_harmonic_centrality_unweighted()
/dports/math/igraph/igraph-0.9.5/src/graph/
H A Dvisitors.c223 long int actdist = (long int) igraph_dqueue_pop(&Q); in igraph_bfs() local
239 VECTOR(*dist)[actvect] = actdist; in igraph_bfs()
247 IGRAPH_CHECK(igraph_dqueue_push(&Q, actdist + 1)); in igraph_bfs()
260 (igraph_integer_t) act_rank - 1, (igraph_integer_t) actdist, in igraph_bfs()
386 long int actdist = (long int) igraph_dqueue_pop(&q); in igraph_bfs_simple() local
397 IGRAPH_CHECK(igraph_dqueue_push(&q, actdist + 1)); in igraph_bfs_simple()
398 if (layers && lastlayer != actdist + 1) { in igraph_bfs_simple()
405 lastlayer = actdist + 1; in igraph_bfs_simple()
/dports/math/igraph/igraph-0.9.5/src/operators/
H A Dconnect_neighborhood.c108 long int actdist = (long int) igraph_dqueue_pop(&q); in igraph_connect_neighborhood() local
113 if (actdist < order - 1) { in igraph_connect_neighborhood()
119 IGRAPH_CHECK(igraph_dqueue_push(&q, actdist + 1)); in igraph_connect_neighborhood()
/dports/math/igraph/igraph-0.9.5/src/layout/
H A Dreingold_tilford.c179 long int actdist = (long int) igraph_dqueue_pop(&q); in igraph_i_layout_reingold_tilford() local
188 MATRIX(*res, neighbor, 1) = actdist + 1; in igraph_i_layout_reingold_tilford()
190 IGRAPH_CHECK(igraph_dqueue_push(&q, actdist + 1)); in igraph_i_layout_reingold_tilford()
192 vdata[neighbor].level = actdist + 1; in igraph_i_layout_reingold_tilford()
/dports/math/igraph/igraph-0.9.5/src/flow/
H A Dflow.c765 long int actdist = (long int) igraph_dqueue_pop(&Q); in igraph_maxflow() local
766 DIST(actnode) = actdist; in igraph_maxflow()
773 IGRAPH_CHECK(igraph_dqueue_push(&Q, actdist + 1)); in igraph_maxflow()
/dports/science/liggghts/LIGGGHTS-PUBLIC-3.8.0-26-g6e873439/lib/hotint/HotInt_V1/ServiceObjectsLib/
H A DGeomElements.cpp3131 double actdist = MinDistTP(p1,p2,p3, pp); in PointIsInside() local
3132 dist = min(dist, actdist); in PointIsInside()