Home
last modified time | relevance | path

Searched refs:print_and_destroy (Results 1 – 13 of 13) sorted by relevance

/dports/math/igraph/igraph-0.9.5/tests/unit/
H A Digraph_average_path_length.c24 void print_and_destroy(igraph_t *graph, igraph_bool_t unconn) { in print_and_destroy() function
40 print_and_destroy(&graph, 1); in main()
44 print_and_destroy(&graph, 1); in main()
48 print_and_destroy(&graph, 1); in main()
52 print_and_destroy(&graph, 0); in main()
57 print_and_destroy(&graph, 1); in main()
62 print_and_destroy(&graph, 1); in main()
66 print_and_destroy(&graph, 1); in main()
70 print_and_destroy(&graph, 1); in main()
75 print_and_destroy(&graph, 1); in main()
H A Digraph_get_adjacency_sparse.c22 void print_and_destroy(igraph_t *g, igraph_get_adjacency_t type) { in print_and_destroy() function
40 print_and_destroy(&g_null, IGRAPH_GET_ADJACENCY_BOTH); in main()
43 print_and_destroy(&g_empty, IGRAPH_GET_ADJACENCY_BOTH); in main()
46 print_and_destroy(&g_lm, IGRAPH_GET_ADJACENCY_BOTH); in main()
49 print_and_destroy(&g_lm_undir, IGRAPH_GET_ADJACENCY_BOTH); in main()
52 print_and_destroy(&g_lm_undir, IGRAPH_GET_ADJACENCY_UPPER); in main()
55 print_and_destroy(&g_lm_undir, IGRAPH_GET_ADJACENCY_LOWER); in main()
H A Digraph_arpack_unpack_complex.c22 void print_and_destroy(igraph_matrix_t *vectors, igraph_matrix_t *values, int nev, igraph_error_typ… in print_and_destroy() function
44 print_and_destroy(&vectors, &values, 0, IGRAPH_SUCCESS); in main()
52 print_and_destroy(&vectors, &values, 2, IGRAPH_SUCCESS); in main()
68 print_and_destroy(&vectors, &values, 6, IGRAPH_SUCCESS); in main()
76 print_and_destroy(&vectors, &values, 4, IGRAPH_SUCCESS); in main()
84 print_and_destroy(&vectors, &values, 2, IGRAPH_SUCCESS); in main()
91 print_and_destroy(&vectors, &values, 4, IGRAPH_SUCCESS); in main()
98 print_and_destroy(&vectors, &values, 0, IGRAPH_SUCCESS); in main()
H A Digraph_neighborhood.c22 void print_and_destroy(igraph_vector_ptr_t *result) { in print_and_destroy() function
47 print_and_destroy(&result); in main()
52 print_and_destroy(&result); in main()
57 print_and_destroy(&result); in main()
62 print_and_destroy(&result); in main()
67 print_and_destroy(&result); in main()
72 print_and_destroy(&result); in main()
77 print_and_destroy(&result); in main()
H A Digraph_neighborhood_graphs.c22 void print_and_destroy(igraph_vector_ptr_t *result) { in print_and_destroy() function
54 print_and_destroy(&result); in main()
59 print_and_destroy(&result); in main()
64 print_and_destroy(&result); in main()
69 print_and_destroy(&result); in main()
74 print_and_destroy(&result); in main()
79 print_and_destroy(&result); in main()
84 print_and_destroy(&result); in main()
H A Digraph_clique_size_hist.c22 void print_and_destroy(igraph_t *g, int min, int max) { in print_and_destroy() function
38 print_and_destroy(&g_empty, 0, 0); in main()
41 print_and_destroy(&g_lm, 0, 0); in main()
44 print_and_destroy(&g_lm, 2, 0); in main()
47 print_and_destroy(&g_lm, 0, 2); in main()
50 print_and_destroy(&g_lm, 10, 10); in main()
H A Digraph_layout_star.c22 void print_and_destroy(igraph_t *g, igraph_integer_t center, igraph_vector_t *order, igraph_error_t… in print_and_destroy() function
45 print_and_destroy(&g, 0, NULL, IGRAPH_SUCCESS); in main()
50 print_and_destroy(&g, 0, &order, IGRAPH_SUCCESS); in main()
57 print_and_destroy(&g, -10, NULL, IGRAPH_EINVAL); in main()
62 print_and_destroy(&g, 0, &order, IGRAPH_EINVAL); in main()
H A Digraph_maximal_cliques4.c37 int print_and_destroy(igraph_vector_ptr_t *cliques) { in print_and_destroy() function
88 print_and_destroy(&cliques); in main()
90 print_and_destroy(&cl1); in main()
92 print_and_destroy(&cl2); in main()
H A Digraph_le_community_to_membership.c22 void print_and_destroy(igraph_vector_t *membership, igraph_vector_t *csize, igraph_matrix_t *mat) { in print_and_destroy() function
43 print_and_destroy(&membership, &csize, &merges); in main()
52 print_and_destroy(&membership, &csize, &merges); in main()
61 print_and_destroy(&membership, &csize, &merges); in main()
H A Digraph_maximal_cliques2.c37 int print_and_destroy(igraph_vector_ptr_t *cliques) { in print_and_destroy() function
66 print_and_destroy(&cliques); in main()
84 print_and_destroy(&cliques); in main()
H A Digraph_maximal_cliques3.c37 int print_and_destroy(igraph_vector_ptr_t *cliques) { in print_and_destroy() function
63 print_and_destroy(&cliques); in main()
/dports/math/igraph/igraph-0.9.5/examples/simple/
H A Digraph_minimum_size_separators.c48 print_and_destroy(&sep); in main()
59 print_and_destroy(&sep); in main()
70 print_and_destroy(&sep); in main()
82 print_and_destroy(&sep); in main()
90 print_and_destroy(&sep); in main()
122 print_and_destroy(&sep); in main()
129 print_and_destroy(&sep); in main()
138 print_and_destroy(&sep); in main()
147 print_and_destroy(&sep); in main()
156 print_and_destroy(&sep); in main()
[all …]
H A Digraph_all_st_mincuts.c26 int print_and_destroy(igraph_t *g, in print_and_destroy() function
86 print_and_destroy(&g, value, &partitions, &cuts); in main()
97 print_and_destroy(&g, value, &partitions, &cuts); in main()
108 print_and_destroy(&g, value, &partitions, &cuts); in main()
121 print_and_destroy(&g, value, &partitions, &cuts); in main()
134 print_and_destroy(&g, value, &partitions, &cuts); in main()
147 print_and_destroy(&g, value, &partitions, &cuts); in main()
161 print_and_destroy(&g, value, &partitions, &cuts); in main()