/dports/math/igraph/igraph-0.9.5/src/properties/ |
H A D | multiplicity.c | 57 igraph_vector_t neis; in igraph_is_simple() local 65 if (VECTOR(neis)[j] == i) { in igraph_is_simple() local 110 igraph_vector_t neis; in igraph_has_multiple() local 119 if (VECTOR(neis)[j - 1] == VECTOR(neis)[j]) { in igraph_has_multiple() local 125 } else if (VECTOR(neis)[j - 1] != i) { in igraph_has_multiple() local 187 igraph_vector_int_t *neis = in igraph_is_multiple() local 254 igraph_vector_int_t *neis = in igraph_count_multiple() local 342 igraph_vector_int_t *neis = igraph_lazy_adjlist_get(&adjlist, in igraph_is_mutual() local
|
H A D | triangles.c | 140 long int *neis; in igraph_transitivity_local_undirected2() local 565 long int *neis; in igraph_transitivity_undirected() local 658 igraph_vector_long_t neis; in igraph_i_transitivity_barrat1() local 700 VECTOR(neis)[nei] = i + 1; in igraph_i_transitivity_barrat1() local 715 if (VECTOR(neis)[v2] == i + 1) { in igraph_i_transitivity_barrat1() local 747 igraph_vector_long_t neis; in igraph_i_transitivity_barrat4() local 798 VECTOR(neis)[nei] = node + 1; in igraph_i_transitivity_barrat4() local 817 if (VECTOR(neis)[nei2] == node + 1) { in igraph_i_transitivity_barrat4() local
|
H A D | neighborhood.c | 80 igraph_vector_t neis; in igraph_neighborhood_size() local 211 igraph_vector_t neis; in igraph_neighborhood() local 358 igraph_vector_t neis; in igraph_neighborhood_graphs() local
|
H A D | dag.c | 65 igraph_vector_t degrees, neis; in igraph_topological_sorting() local 145 igraph_vector_t degrees, neis; in igraph_is_dag() local
|
H A D | triangles_template1.h | 32 long int *neis; variable
|
H A D | degrees.c | 88 igraph_vector_t neis, edge_neis; in igraph_i_avg_nearest_neighbor_degree_weighted() local 261 igraph_vector_t neis; in igraph_avg_nearest_neighbor_degree() local 384 igraph_vector_t neis; in igraph_strength() local
|
/dports/math/igraph/igraph-0.9.5/src/misc/ |
H A D | scan.c | 130 igraph_vector_int_t neis; in igraph_i_local_scan_1_directed() local 148 VECTOR(neis)[node] = node + 1; in igraph_i_local_scan_1_directed() local 153 VECTOR(neis)[nei] = node + 1; in igraph_i_local_scan_1_directed() local 193 igraph_vector_int_t neis; in igraph_i_local_scan_1_directed_all() local 218 VECTOR(neis)[nei] = node + 1; in igraph_i_local_scan_1_directed_all() local 230 if (VECTOR(neis)[nei] != node + 1) { in igraph_i_local_scan_1_directed_all() local 243 VECTOR(neis)[nei] = 0; in igraph_i_local_scan_1_directed_all() local 264 long int *neis; in igraph_i_local_scan_1_sumweights() local 496 igraph_vector_int_t neis; in igraph_local_scan_1_ecount_them() local 534 VECTOR(neis)[node] = node + 1; in igraph_local_scan_1_ecount_them() local [all …]
|
/dports/math/R-cran-igraph/igraph/src/ |
H A D | scan.c | 131 igraph_vector_int_t neis; in igraph_i_local_scan_1_directed() local 149 VECTOR(neis)[node] = node + 1; in igraph_i_local_scan_1_directed() local 154 VECTOR(neis)[nei] = node + 1; in igraph_i_local_scan_1_directed() local 191 igraph_vector_int_t neis; in igraph_i_local_scan_1_directed_all() local 216 VECTOR(neis)[nei] = node + 1; in igraph_i_local_scan_1_directed_all() local 228 if (VECTOR(neis)[nei] != node + 1) { in igraph_i_local_scan_1_directed_all() local 241 VECTOR(neis)[nei] = 0; in igraph_i_local_scan_1_directed_all() local 262 long int *neis; in igraph_i_local_scan_1_sumweights() local 498 igraph_vector_int_t neis; in igraph_local_scan_1_ecount_them() local 535 VECTOR(neis)[node] = node + 1; in igraph_local_scan_1_ecount_them() local [all …]
|
H A D | separators.c | 41 igraph_vector_t *neis, in igraph_i_is_separator() 153 igraph_vector_t neis; in igraph_is_separator() local 211 igraph_vector_t neis; in igraph_is_minimal_separator() local 293 igraph_vector_int_t *neis = igraph_adjlist_get(adjlist, act_node); in igraph_i_clusters_leaveout() local 355 igraph_vector_int_t *neis = igraph_adjlist_get(adjlist, next); in igraph_i_separators_store() local 488 igraph_vector_int_t *neis = igraph_adjlist_get(&adjlist, v); in igraph_all_minimal_st_separators() local 518 igraph_vector_int_t *neis = igraph_adjlist_get(&adjlist, x); in igraph_all_minimal_st_separators() local
|
H A D | triangles.c | 91 long int *neis; in igraph_transitivity_avglocal_undirected() local 200 long int *neis; in igraph_transitivity_local_undirected2() local 645 long int *neis; in igraph_transitivity_undirected() local 745 igraph_vector_long_t neis; in igraph_transitivity_barrat1() local 791 VECTOR(neis)[nei] = i + 1; in igraph_transitivity_barrat1() local 806 if (VECTOR(neis)[v2] == i + 1) { in igraph_transitivity_barrat1() local 839 igraph_vector_long_t neis; in igraph_transitivity_barrat4() local 894 VECTOR(neis)[nei] = node + 1; in igraph_transitivity_barrat4() local 913 if (VECTOR(neis)[nei2] == node + 1) { in igraph_transitivity_barrat4() local
|
H A D | type_indexededgelist.c | 738 int igraph_neighbors(const igraph_t *graph, igraph_vector_t *neis, igraph_integer_t pnode, in igraph_neighbors() 774 VECTOR(*neis)[idx++] = in igraph_neighbors() local 781 VECTOR(*neis)[idx++] = in igraph_neighbors() local 798 VECTOR(*neis)[idx++] = n1; in igraph_neighbors() local 801 VECTOR(*neis)[idx++] = n2; in igraph_neighbors() local 804 VECTOR(*neis)[idx++] = n1; in igraph_neighbors() local 805 VECTOR(*neis)[idx++] = n2; in igraph_neighbors() local 813 VECTOR(*neis)[idx++] = n1; in igraph_neighbors() local 819 VECTOR(*neis)[idx++] = n2; in igraph_neighbors() local
|
H A D | structural_properties.c | 105 igraph_vector_int_t *neis; in igraph_diameter() local 238 igraph_vector_int_t *neis; in igraph_average_path_length() local 345 igraph_vector_int_t *neis; in igraph_path_length_hist() local 1015 igraph_vector_t neis; in igraph_get_all_shortest_paths() local 3009 igraph_vector_t neis; in igraph_neighborhood_size() local 3137 igraph_vector_t neis; in igraph_neighborhood() local 3282 igraph_vector_t neis; in igraph_neighborhood_graphs() local 3909 igraph_vector_t *neis; in igraph_girth() local 5738 igraph_vector_t neis; in igraph_unfold_tree() local 6090 igraph_vector_t neis; in igraph_avg_nearest_neighbor_degree() local [all …]
|
H A D | triangles_template1.h | 32 long int *neis; variable
|
/dports/math/igraph/igraph-0.9.5/tests/unit/ |
H A D | igraph_i_neighbors.c | 24 igraph_vector_t neis; in call_and_print() local 41 igraph_vector_t neis; in main() local
|
/dports/math/igraph/igraph-0.9.5/src/connectivity/ |
H A D | separators.c | 44 igraph_vector_t *neis, in igraph_i_is_separator() 156 igraph_vector_t neis; in igraph_is_separator() local 215 igraph_vector_t neis; in igraph_is_minimal_separator() local 297 igraph_vector_int_t *neis = igraph_adjlist_get(adjlist, act_node); in igraph_i_clusters_leaveout() local 359 igraph_vector_int_t *neis = igraph_adjlist_get(adjlist, next); in igraph_i_separators_store() local 506 igraph_vector_int_t *neis = igraph_adjlist_get(&adjlist, v); in igraph_all_minimal_st_separators() local 536 igraph_vector_int_t *neis = igraph_adjlist_get(&adjlist, x); in igraph_all_minimal_st_separators() local
|
/dports/math/igraph/igraph-0.9.5/src/operators/ |
H A D | complementer.c | 56 igraph_vector_t neis; in igraph_complementer() local
|
H A D | connect_neighborhood.c | 70 igraph_vector_t neis; in igraph_connect_neighborhood() local
|
/dports/math/igraph/igraph-0.9.5/src/graph/ |
H A D | type_indexededgelist.c | 739 int igraph_neighbors(const igraph_t *graph, igraph_vector_t *neis, igraph_integer_t pnode, in igraph_neighbors() 748 int igraph_i_neighbors(const igraph_t *graph, igraph_vector_t *neis, igraph_integer_t pnode, in igraph_i_neighbors() 821 VECTOR(*neis)[idx++] = to; in igraph_i_neighbors() local 829 VECTOR(*neis)[idx++] = from; in igraph_i_neighbors() local 854 VECTOR(*neis)[idx++] = n1; in igraph_i_neighbors() local 858 VECTOR(*neis)[idx++] = n2; in igraph_i_neighbors() local 863 VECTOR(*neis)[idx++] = n1; in igraph_i_neighbors() local 869 VECTOR(*neis)[idx++] = n2; in igraph_i_neighbors() local 877 VECTOR(*neis)[idx++] = to; in igraph_i_neighbors() local 884 VECTOR(*neis)[idx++] = from; in igraph_i_neighbors() local
|
H A D | visitors.c | 225 igraph_vector_int_t *neis = igraph_lazy_adjlist_get(&adjlist, in igraph_bfs() local 333 igraph_vector_t neis; in igraph_bfs_simple() local 585 igraph_vector_int_t *neis = in igraph_dfs() local
|
/dports/math/igraph/igraph-0.9.5/src/centrality/ |
H A D | closeness.c | 206 igraph_vector_int_t *neis = igraph_lazy_inclist_get(&inclist, minnei); in igraph_i_closeness_cutoff_weighted() local 413 igraph_vector_int_t *neis; in igraph_closeness_cutoff() local 534 igraph_vector_int_t *neis; in igraph_i_harmonic_centrality_unweighted() local 689 igraph_vector_int_t *neis = igraph_lazy_inclist_get(&inclist, minnei); in igraph_i_harmonic_centrality_weighted() local
|
H A D | coreness.c | 65 igraph_vector_t neis; in igraph_coreness() local
|
/dports/math/igraph/igraph-0.9.5/src/centrality/prpack/ |
H A D | prpack_igraph_graph.cpp | 17 igraph_vector_t neis; in prpack_igraph_graph() local
|
/dports/math/R-cran-igraph/igraph/src/prpack/ |
H A D | prpack_igraph_graph.cpp | 15 igraph_vector_t neis; in prpack_igraph_graph() local
|
/dports/math/igraph/igraph-0.9.5/src/paths/ |
H A D | shortest_paths.c | 55 igraph_vector_int_t *neis; in igraph_i_average_path_length_unweighted() local 221 igraph_vector_int_t *neis; in igraph_i_average_path_length_dijkstra() local 594 igraph_vector_int_t *neis; in igraph_i_local_efficiency_dijkstra() local 941 igraph_vector_int_t *neis; in igraph_diameter() local 1188 igraph_vector_int_t *neis; in igraph_diameter_dijkstra() local
|
/dports/math/igraph/igraph-0.9.5/src/community/ |
H A D | leading_eigenvector.c | 112 igraph_vector_int_t *neis = igraph_adjlist_get(adjlist, oldid); in igraph_i_community_leading_eigenvector() local 130 igraph_vector_int_t *neis = igraph_adjlist_get(adjlist, oldid); in igraph_i_community_leading_eigenvector() local 141 igraph_vector_int_t *neis = igraph_adjlist_get(adjlist, oldid); in igraph_i_community_leading_eigenvector() local 173 igraph_vector_int_t *neis = igraph_adjlist_get(adjlist, oldid); in igraph_i_community_leading_eigenvector2() local 194 igraph_vector_int_t *neis = igraph_adjlist_get(adjlist, oldid); in igraph_i_community_leading_eigenvector2() local 207 igraph_vector_int_t *neis = igraph_adjlist_get(adjlist, oldid); in igraph_i_community_leading_eigenvector2() local
|