| /dports/math/igraph/igraph-0.9.5/src/constructors/ |
| H A D | adjacency.c | 42 long int no_of_nodes = igraph_matrix_nrow(adjmatrix); in igraph_i_adjacency_directed() local
60 long int no_of_nodes = igraph_matrix_nrow(adjmatrix); in igraph_i_adjacency_max() local
82 long int no_of_nodes = igraph_matrix_nrow(adjmatrix); in igraph_i_adjacency_upper() local
99 long int no_of_nodes = igraph_matrix_nrow(adjmatrix); in igraph_i_adjacency_lower() local
116 long int no_of_nodes = igraph_matrix_nrow(adjmatrix); in igraph_i_adjacency_min() local
199 long int no_of_nodes; in igraph_adjacency() local
276 long int no_of_nodes = igraph_matrix_nrow(adjmatrix); in igraph_i_weighted_adjacency_directed() local
303 long int no_of_nodes = igraph_matrix_nrow(adjmatrix); in igraph_i_weighted_adjacency_plus() local
333 long int no_of_nodes = igraph_matrix_nrow(adjmatrix); in igraph_i_weighted_adjacency_max() local
514 long int no_of_nodes; in igraph_weighted_adjacency() local
[all …]
|
| /dports/math/igraph/igraph-0.9.5/src/layout/ |
| H A D | layout_random.c | 45 long int no_of_nodes = igraph_vcount(graph); in igraph_layout_random() local
82 long int no_of_nodes = igraph_vcount(graph); in igraph_layout_random_3d() local
|
| H A D | circular.c | 51 long int no_of_nodes = igraph_vcount(graph); in igraph_layout_circle() local
93 long int no_of_nodes = igraph_vcount(graph); in igraph_layout_star() local
152 long int no_of_nodes = igraph_vcount(graph); in igraph_layout_sphere() local
|
| H A D | layout_grid.c | 45 long int i, no_of_nodes = igraph_vcount(graph); in igraph_layout_grid() local
86 long int i, no_of_nodes = igraph_vcount(graph); in igraph_layout_grid_3d() local
|
| H A D | mds.c | 55 long int no_of_nodes = igraph_vcount(graph); in igraph_i_layout_mds_single() local
183 long int i, no_of_nodes = igraph_vcount(graph); in igraph_layout_mds() local
|
| /dports/math/R-cran-igraph/igraph/src/ |
| H A D | structure_generators.c | 116 long int no_of_nodes = igraph_matrix_nrow(adjmatrix); in igraph_i_adjacency_directed() local
134 long int no_of_nodes = igraph_matrix_nrow(adjmatrix); in igraph_i_adjacency_max() local
156 long int no_of_nodes = igraph_matrix_nrow(adjmatrix); in igraph_i_adjacency_upper() local
173 long int no_of_nodes = igraph_matrix_nrow(adjmatrix); in igraph_i_adjacency_lower() local
274 long int no_of_nodes; in igraph_adjacency() local
590 long int no_of_nodes; in igraph_weighted_adjacency() local
1339 long int no_of_nodes = igraph_vcount(graph); in igraph_connect_neighborhood() local
1474 long int no_of_nodes, no_of_edges; in igraph_de_bruijn() local
1552 long int no_of_nodes, no_of_edges; in igraph_kautz() local
1702 long int no_of_nodes = n; in igraph_lcf_vector() local
[all …]
|
| H A D | conversion.c | 74 long int no_of_nodes = igraph_vcount(graph); in igraph_get_adjacency() local
206 long int no_of_nodes = igraph_vcount(graph); in igraph_get_adjacency_sparse() local
359 long int no_of_nodes = igraph_vcount(graph); in igraph_to_directed() local
381 long int no_of_nodes = igraph_vcount(graph); in igraph_to_directed() local
446 long int no_of_nodes = igraph_vcount(graph); in igraph_to_undirected() local
754 int no_of_nodes = igraph_vcount(graph); in igraph_get_stochastic() local
790 int no_of_nodes = (int) igraph_sparsemat_nrow(sparsemat); in igraph_i_normalize_sparsemat() local
|
| H A D | separators.c | 42 long int no_of_nodes) { in igraph_i_is_separator()
150 long int no_of_nodes = igraph_vcount(graph); in igraph_is_separator() local
208 long int no_of_nodes = igraph_vcount(graph); in igraph_is_minimal_separator() local
276 long int i, no_of_nodes = igraph_adjlist_size(adjlist); in igraph_i_clusters_leaveout() local
449 long int no_of_nodes = igraph_vcount(graph); in igraph_all_minimal_st_separators() local
590 long int no_of_nodes = igraph_vcount(graph); in igraph_i_minimum_size_separators_topkdeg() local
654 long int no_of_nodes = igraph_vcount(graph); in igraph_minimum_size_separators() local
|
| H A D | bipartite.c | 94 long int no_of_nodes = igraph_vcount(graph); in igraph_bipartite_projection_size() local
159 long int no_of_nodes = igraph_vcount(graph); in igraph_i_bipartite_projection() local
326 long int no_of_nodes = igraph_vcount(graph); in igraph_bipartite_projection() local
414 igraph_integer_t no_of_nodes = nn1 + nn2; in igraph_full_bipartite() local
508 igraph_integer_t no_of_nodes = in igraph_create_bipartite() local
603 igraph_integer_t no_of_nodes = n1 + n2; in igraph_incidence() local
721 long int no_of_nodes = igraph_vcount(graph); in igraph_get_incidence() local
827 long int no_of_nodes = igraph_vcount(graph); in igraph_is_bipartite() local
|
| H A D | layout.c | 78 long int no_of_nodes = igraph_vcount(graph); in igraph_layout_random() local
112 long int no_of_nodes = igraph_vcount(graph); in igraph_layout_random_3d() local
151 long int no_of_nodes = igraph_vcount(graph); in igraph_layout_circle() local
194 long int no_of_nodes = igraph_vcount(graph); in igraph_layout_star() local
248 long int no_of_nodes = igraph_vcount(graph); in igraph_layout_sphere() local
300 long int i, no_of_nodes = igraph_vcount(graph); in igraph_layout_grid() local
444 long int no_of_nodes = igraph_vcount(graph); in igraph_layout_lgl() local
700 long int no_of_nodes, in igraph_i_layout_reingold_tilford_unreachable()
797 long int no_of_nodes = igraph_vcount(graph); in igraph_i_layout_reingold_tilford() local
1162 long int no_of_nodes = no_of_nodes_orig; in igraph_layout_reingold_tilford() local
[all …]
|
| H A D | distances.c | 40 int no_of_nodes = igraph_vcount(graph); in igraph_i_eccentricity() local
193 int no_of_nodes = igraph_vcount(graph); in igraph_radius() local
|
| H A D | structural_properties.c | 97 long int no_of_nodes = igraph_vcount(graph); in igraph_diameter() local
231 long int no_of_nodes = igraph_vcount(graph); in igraph_average_path_length() local
339 long int no_of_nodes = igraph_vcount(graph); in igraph_path_length_hist() local
483 long int no_of_nodes = igraph_vcount(graph); in igraph_shortest_paths() local
681 long int no_of_nodes = igraph_vcount(graph); in igraph_get_shortest_paths() local
1010 long int no_of_nodes = igraph_vcount(graph); in igraph_get_all_shortest_paths() local
1274 long int no_of_nodes = igraph_vcount(graph); in igraph_subcomponent() local
1407 long int no_of_nodes = igraph_vcount(graph); in igraph_pagerank_old() local
1558 long int no_of_nodes = igraph_vcount(graph); in igraph_i_rewire() local
1800 long int no_of_nodes = igraph_vcount(graph); in igraph_i_subgraph_copy_and_delete() local
[all …]
|
| /dports/math/igraph/igraph-0.9.5/src/properties/ |
| H A D | basic_properties.c | 61 igraph_integer_t no_of_nodes = igraph_vcount(graph); in igraph_density() local
126 int no_of_nodes = igraph_vcount(graph); in igraph_diversity() local
245 long int no_of_nodes = igraph_vcount(graph); in igraph_reciprocity() local
|
| H A D | dag.c | 64 long int no_of_nodes = igraph_vcount(graph); in igraph_topological_sorting() local
144 long int no_of_nodes = igraph_vcount(graph); in igraph_is_dag() local
211 long int no_of_nodes = igraph_vcount(graph); in igraph_transitive_closure_dag() local
|
| H A D | neighborhood.c | 75 long int no_of_nodes = igraph_vcount(graph); in igraph_neighborhood_size() local
206 long int no_of_nodes = igraph_vcount(graph); in igraph_neighborhood() local
353 long int no_of_nodes = igraph_vcount(graph); in igraph_neighborhood_graphs() local
|
| /dports/math/igraph/igraph-0.9.5/src/connectivity/ |
| H A D | separators.c | 45 long int no_of_nodes) { in igraph_i_is_separator()
153 long int no_of_nodes = igraph_vcount(graph); in igraph_is_separator() local
212 long int no_of_nodes = igraph_vcount(graph); in igraph_is_minimal_separator() local
280 long int i, no_of_nodes = igraph_adjlist_size(adjlist); in igraph_i_clusters_leaveout() local
467 long int no_of_nodes = igraph_vcount(graph); in igraph_all_minimal_st_separators() local
608 long int no_of_nodes = igraph_vcount(graph); in igraph_i_minimum_size_separators_topkdeg() local
673 long int no_of_nodes = igraph_vcount(graph); in igraph_minimum_size_separators() local
|
| /dports/math/igraph/igraph-0.9.5/src/misc/ |
| H A D | conversion.c | 79 long int no_of_nodes = igraph_vcount(graph); in igraph_get_adjacency() local
211 long int no_of_nodes = igraph_vcount(graph); in igraph_get_adjacency_sparse() local
362 long int no_of_nodes = igraph_vcount(graph); in igraph_to_directed() local
503 long int no_of_nodes = igraph_vcount(graph); in igraph_to_undirected() local
796 int no_of_nodes = igraph_vcount(graph); in igraph_get_stochastic() local
832 int no_of_nodes = (int) igraph_sparsemat_nrow(sparsemat); in igraph_i_normalize_sparsemat() local
|
| H A D | bipartite.c | 96 long int no_of_nodes = igraph_vcount(graph); in igraph_bipartite_projection_size() local
161 long int no_of_nodes = igraph_vcount(graph); in igraph_i_bipartite_projection() local
329 long int no_of_nodes = igraph_vcount(graph); in igraph_bipartite_projection() local
417 igraph_integer_t no_of_nodes = nn1 + nn2; in igraph_full_bipartite() local
512 igraph_integer_t no_of_nodes = in igraph_create_bipartite() local
598 igraph_integer_t no_of_nodes = n1 + n2; in igraph_incidence() local
718 long int no_of_nodes = igraph_vcount(graph); in igraph_get_incidence() local
829 long int no_of_nodes = igraph_vcount(graph); in igraph_is_bipartite() local
|
| /dports/math/igraph/igraph-0.9.5/examples/simple/ |
| H A D | walktrap.c | 30 long int no_of_nodes; in main() local
|
| /dports/math/igraph/igraph-0.9.5/src/paths/ |
| H A D | shortest_paths.c | 48 long int no_of_nodes = igraph_vcount(graph); in igraph_i_average_path_length_unweighted() local
169 long int no_of_nodes = igraph_vcount(graph); in igraph_i_average_path_length_dijkstra() local
443 long int no_of_nodes = igraph_vcount(graph); in igraph_i_local_efficiency_unweighted() local
705 long int no_of_nodes = igraph_vcount(graph); in igraph_local_efficiency() local
860 long int no_of_nodes = igraph_vcount(graph); in igraph_average_local_efficiency() local
933 long int no_of_nodes = igraph_vcount(graph); in igraph_diameter() local
1117 long int no_of_nodes = igraph_vcount(graph); in igraph_diameter_dijkstra() local
|
| H A D | distances.c | 42 int no_of_nodes = igraph_vcount(graph); in igraph_i_eccentricity() local
195 int no_of_nodes = igraph_vcount(graph); in igraph_radius() local
|
| /dports/math/igraph/igraph-0.9.5/src/games/ |
| H A D | k_regular.c | 61 igraph_integer_t no_of_nodes, igraph_integer_t k, in igraph_k_regular_game()
|
| /dports/math/igraph/igraph-0.9.5/src/operators/ |
| H A D | subgraph.c | 41 long int no_of_nodes = igraph_vcount(graph); in igraph_i_induced_subgraph_copy_and_delete() local
103 long int no_of_nodes = igraph_vcount(graph); in igraph_i_induced_subgraph_create_from_scratch() local
405 long int no_of_nodes = igraph_vcount(graph); in igraph_subgraph_edges() local
|
| /dports/math/igraph/igraph-0.9.5/src/io/ |
| H A D | dimacs.c | 86 long int no_of_nodes = -1; in igraph_read_graph_dimacs() local
278 long int no_of_nodes = igraph_vcount(graph); in igraph_write_graph_dimacs() local
|
| /dports/math/igraph/igraph-0.9.5/src/scg/ |
| H A D | scg.c | 363 int no_of_nodes = (int) igraph_matrix_nrow(V); in igraph_scg_grouping() local
497 int no_of_nodes) { in igraph_i_scg_semiprojectors_sym()
562 int no_of_nodes, in igraph_i_scg_semiprojectors_lap()
659 int no_of_nodes, in igraph_i_scg_semiprojectors_sto()
835 int no_of_nodes = (int) igraph_vector_size(groups); in igraph_scg_semiprojectors() local
919 int no_of_nodes = (int) igraph_vector_size(groups); in igraph_scg_norm_eps() local
1299 int no_of_nodes = -1; in igraph_i_scg_common_checks() local
1486 int no_of_nodes; in igraph_scg_adjacency() local
1756 int no_of_nodes; in igraph_scg_stochastic() local
2112 int no_of_nodes; in igraph_scg_laplacian() local
|