/dports/math/igraph/igraph-0.9.5/src/properties/ |
H A D | girth.c | 114 long int actnode = (long int) igraph_dqueue_pop(&q); in igraph_girth() local 176 long int actnode = (long int) igraph_dqueue_pop(&q); in igraph_girth() local
|
H A D | neighborhood.c | 114 long int actnode = (long int) igraph_dqueue_pop(&q); in igraph_neighborhood_size() local 249 long int actnode = (long int) igraph_dqueue_pop(&q); in igraph_neighborhood() local 396 long int actnode = (long int) igraph_dqueue_pop(&q); in igraph_neighborhood_graphs() local
|
H A D | convergence_degree.c | 130 long int actnode = (long int) igraph_dqueue_pop(&q); in igraph_convergence_degree() local
|
H A D | trees.c | 98 long int actnode = (long int) igraph_dqueue_pop(&Q); in igraph_unfold_tree() local
|
/dports/math/igraph/igraph-0.9.5/src/operators/ |
H A D | connect_neighborhood.c | 107 long int actnode = (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 | 100 long int actnode = (long int) igraph_dqueue_pop(&q); in igraph_path_length_hist() local
|
H A D | all_shortest_paths.c | 192 long int actnode = (long int) igraph_dqueue_pop(&q); in igraph_get_all_shortest_paths() local
|
H A D | shortest_paths.c | 81 long int actnode = (long int) igraph_dqueue_pop(&q); in igraph_i_average_path_length_unweighted() local 989 long int actnode = (long int) igraph_dqueue_pop(&q); in igraph_diameter() local
|
/dports/math/igraph/igraph-0.9.5/src/centrality/ |
H A D | betweenness.c | 398 long int actnode = (long int) igraph_dqueue_pop(&q); in igraph_betweenness_cutoff() local 434 long int actnode = (long int) igraph_stack_pop(&stack); in igraph_betweenness_cutoff() local 877 long int actnode = (long int) igraph_dqueue_pop(&q); in igraph_edge_betweenness_cutoff() local 914 long int actnode = (long int) igraph_stack_pop(&stack); in igraph_edge_betweenness_cutoff() local
|
/dports/cad/electric/electric-7.00/src/sc/ |
H A D | sc1extract.c | 325 SCEXTNODE **root, SCEXTNODE **actnode) in Sc_extract_add_node()
|
/dports/math/igraph/igraph-0.9.5/src/games/ |
H A D | forestfire.c | 111 long int no_of_nodes = nodes, actnode, i; in igraph_forest_fire_game() local
|
/dports/math/R-cran-igraph/igraph/src/ |
H A D | forestfire.c | 111 long int no_of_nodes = nodes, actnode, i; in igraph_forest_fire_game() local
|
H A D | structural_properties.c | 135 long int actnode = (long int) igraph_dqueue_pop(&q); in igraph_diameter() local 267 long int actnode = (long int) igraph_dqueue_pop(&q); in igraph_average_path_length() local 377 long int actnode = (long int) igraph_dqueue_pop(&q); in igraph_path_length_hist() local 1099 long int actnode = (long int) igraph_dqueue_pop(&q); in igraph_get_all_shortest_paths() local 1304 long int actnode = (long int) igraph_dqueue_pop(&q); in igraph_subcomponent() local 3042 long int actnode = (long int) igraph_dqueue_pop(&q); in igraph_neighborhood_size() local 3175 long int actnode = (long int) igraph_dqueue_pop(&q); in igraph_neighborhood() local 3320 long int actnode = (long int) igraph_dqueue_pop(&q); in igraph_neighborhood_graphs() local 3943 long int actnode = (long int) igraph_dqueue_pop(&q); in igraph_girth() local 4005 long int actnode = (long int) igraph_dqueue_pop(&q); in igraph_girth() local [all …]
|
/dports/math/igraph/igraph-0.9.5/src/community/ |
H A D | edge_betweenness.c | 556 long int actnode = (long int) igraph_dqueue_pop(&q); in igraph_community_edge_betweenness() local 582 long int actnode = (long int) igraph_stack_pop(&stack); in igraph_community_edge_betweenness() local
|
/dports/math/igraph/igraph-0.9.5/src/layout/ |
H A D | reingold_tilford.c | 64 long int actnode = (long int) igraph_dqueue_pop(&q); in igraph_i_layout_reingold_tilford_unreachable() local 178 long int actnode = (long int) igraph_dqueue_pop(&q); in igraph_i_layout_reingold_tilford() local
|
/dports/audio/libmodplug/libmodplug-0.8.9.0/src/ |
H A D | load_dmf.cpp | 541 UINT actnode; in DMFNewNode() local 576 UINT actnode; in DMFUnpack() local
|
/dports/cad/calculix-ccx/CalculiX/ccx_2.18/src/ |
H A D | pretransition.f | 30 & actnode,kflag,ndesinode local
|
/dports/sysutils/moosefs3-netdump/moosefs-3.0.116/mfsclient/ |
H A D | labelparser.c | 105 static inline void expr_rfree(node *actnode) { in expr_rfree()
|
/dports/sysutils/moosefs3-cgi/moosefs-3.0.116/mfsclient/ |
H A D | labelparser.c | 105 static inline void expr_rfree(node *actnode) { in expr_rfree()
|
/dports/sysutils/moosefs3-cgiserv/moosefs-3.0.116/mfsclient/ |
H A D | labelparser.c | 105 static inline void expr_rfree(node *actnode) { in expr_rfree()
|
/dports/sysutils/moosefs3-chunkserver/moosefs-3.0.116/mfsclient/ |
H A D | labelparser.c | 105 static inline void expr_rfree(node *actnode) { in expr_rfree()
|
/dports/sysutils/moosefs3-cli/moosefs-3.0.116/mfsclient/ |
H A D | labelparser.c | 105 static inline void expr_rfree(node *actnode) { in expr_rfree()
|
/dports/sysutils/moosefs3-client/moosefs-3.0.116/mfsclient/ |
H A D | labelparser.c | 105 static inline void expr_rfree(node *actnode) { in expr_rfree()
|
/dports/sysutils/moosefs3-metalogger/moosefs-3.0.116/mfsclient/ |
H A D | labelparser.c | 105 static inline void expr_rfree(node *actnode) { in expr_rfree()
|
/dports/sysutils/moosefs3-master/moosefs-3.0.116/mfsclient/ |
H A D | labelparser.c | 105 static inline void expr_rfree(node *actnode) { in expr_rfree()
|