abdelrahman/agent_compositor_test
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Add graph references

Browse Source
This commit is contained in:
Abdelrahman Said
2026-06-28 13:49:01 +01:00
parent 0a9807e448
commit a11edf0c53
2578 changed files with 868045 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files
references/igraph-1.0.1/tests/unit/vector.c
+374
View File
@@ -0,0 +1,374 @@
/*
igraph library.
Copyright (C) 2006-2024 The igraph development team <igraph@igraph.org>
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see <https://www.gnu.org/licenses/>.
*/
#include <igraph.h>
#include "test_utilities.h"
int main(void) {
igraph_vector_t v;
igraph_vector_int_t v2, v4, v5, v6;
igraph_int_t i;
igraph_real_t *ptr;
igraph_int_t pos;
igraph_real_t min, max, min2, max2;
igraph_int_t which_min, which_max, which_min2, which_max2;
printf("Initialise empty vector\n");
igraph_vector_init(&v, 0);
igraph_vector_destroy(&v);
printf("Initialise vector of length 10\n");
igraph_vector_init(&v, 10);
print_vector_format(&v, stdout, "%g");
igraph_vector_destroy(&v);
printf("Test VECTOR() and igraph_vector_size\n");
igraph_vector_init(&v, 10);
for (i = 0; i < igraph_vector_size(&v); i++) {
VECTOR(v)[i] = 10 - i;
}
print_vector_format(&v, stdout, "%g");
igraph_vector_destroy(&v);
printf("Test igraph_vector_reserve and igraph_vector_push_back\n");
igraph_vector_init(&v, 0);
igraph_vector_reserve(&v, 10);
for (i = 0; i < 10; i++) {
igraph_vector_push_back(&v, i);
}
printf("Test igraph_vector_empty and igraph_vector_clear\n");
IGRAPH_ASSERT(!igraph_vector_empty(&v));
igraph_vector_clear(&v);
IGRAPH_ASSERT(igraph_vector_empty(&v));
igraph_vector_destroy(&v);
printf("Test igraph_vector_get and igraph_vector_get_ptr\n");
igraph_vector_init(&v, 5);
for (i = 0; i < igraph_vector_size(&v); i++) {
*igraph_vector_get_ptr(&v, i) = 100 * i;
}
for (i = 0; i < igraph_vector_size(&v); i++) {
printf(" %" IGRAPH_PRId "", (igraph_int_t)igraph_vector_get(&v, i));
}
printf("\n");
igraph_vector_destroy(&v);
printf("Test igraph_vector_set\n");
igraph_vector_init(&v, 5);
for (i = 0; i < igraph_vector_size(&v); i++) {
igraph_vector_set(&v, i, 20 * i);
}
print_vector_format(&v, stdout, "%g");
igraph_vector_destroy(&v);
printf("Test igraph_vector_null\n");
igraph_vector_init(&v, 0);
igraph_vector_null(&v);
igraph_vector_destroy(&v);
igraph_vector_init(&v, 10);
for (i = 0; i < igraph_vector_size(&v); i++) {
VECTOR(v)[i] = i + 1;
}
igraph_vector_null(&v);
print_vector_format(&v, stdout, "%g");
igraph_vector_destroy(&v);
printf("Test igraph_vector_tail, igraph_vector_pop_back\n");
igraph_vector_init(&v, 10);
for (i = 0; i < igraph_vector_size(&v); i++) {
VECTOR(v)[i] = i + 1;
}
while (!igraph_vector_empty(&v)) {
printf(" %" IGRAPH_PRId "", (igraph_int_t)igraph_vector_tail(&v));
printf(" %" IGRAPH_PRId "", (igraph_int_t)igraph_vector_pop_back(&v));
}
printf("\n");
igraph_vector_destroy(&v);
printf("Test igraph_vector_resize, igraph_vector_sort\n");
igraph_vector_init(&v, 20);
for (i = 0; i < 10; i++) {
VECTOR(v)[i] = 10 - i;
}
igraph_vector_resize(&v, 10);
igraph_vector_sort(&v);
print_vector_format(&v, stdout, "%g");
igraph_vector_destroy(&v);
printf("Test igraph_vector_{which}_{min, max}\n");
igraph_vector_init(&v, 10);
for (i = 0; i < igraph_vector_size(&v); i++) {
VECTOR(v)[i] = 100 - i;
}
for (i = 0; i < 10; i++) {
printf(" %" IGRAPH_PRId "", (igraph_int_t)VECTOR(v)[i]);
}
printf("\n");
min = igraph_vector_min(&v);
which_min = igraph_vector_which_min(&v);
IGRAPH_ASSERT(min == 91);
IGRAPH_ASSERT(which_min == 9);
IGRAPH_ASSERT(min == VECTOR(v)[which_min]);
max = igraph_vector_max(&v);
which_max = igraph_vector_which_max(&v);
IGRAPH_ASSERT(max == 100);
IGRAPH_ASSERT(which_max == 0);
IGRAPH_ASSERT(max == VECTOR(v)[which_max]);
igraph_vector_minmax(&v, &min2, &max2);
igraph_vector_which_minmax(&v, &which_min2, &which_max2);
IGRAPH_ASSERT(min == min2);
IGRAPH_ASSERT(max == max2);
IGRAPH_ASSERT(which_min == which_min2);
IGRAPH_ASSERT(which_max == which_max2);
IGRAPH_ASSERT(min2 == VECTOR(v)[which_min2]);
IGRAPH_ASSERT(max2 == VECTOR(v)[which_max2]);
printf("Test NaN values\n");
igraph_vector_push_back(&v, IGRAPH_NAN);
igraph_vector_push_back(&v, IGRAPH_NAN);
igraph_vector_push_back(&v, 1);
IGRAPH_ASSERT(igraph_vector_is_any_nan(&v));
min = igraph_vector_min(&v);
which_min = igraph_vector_which_min(&v);
IGRAPH_ASSERT(isnan(min));
/* Index should be to first NaN value */
IGRAPH_ASSERT(which_min == 10);
IGRAPH_ASSERT(isnan(VECTOR(v)[which_min]));
max = igraph_vector_max(&v);
which_max = igraph_vector_which_max(&v);
IGRAPH_ASSERT(isnan(max));
/* Index should be to first NaN value */
IGRAPH_ASSERT(which_max == 10);
/* In case of NaN it should hold that which_max == which_min */
IGRAPH_ASSERT(which_max == which_min);
igraph_vector_minmax(&v, &min2, &max2);
igraph_vector_which_minmax(&v, &which_min2, &which_max2);
IGRAPH_ASSERT(isnan(min2));
IGRAPH_ASSERT(isnan(max2));
IGRAPH_ASSERT(which_min == which_min2);
IGRAPH_ASSERT(which_max == which_max2);
/* In case of NaN it should hold that which_max == which_min */
IGRAPH_ASSERT(which_min2 == which_max2);
IGRAPH_ASSERT(isnan(VECTOR(v)[which_min2]));
IGRAPH_ASSERT(isnan(VECTOR(v)[which_max2]));
printf("Test igraph_vector_init_array\n");
igraph_vector_destroy(&v);
ptr = (igraph_real_t*) malloc(10 * sizeof(igraph_real_t));
igraph_vector_init_array(&v, ptr, 10);
free(ptr);
for (i = 0; i < 10; i++) {
VECTOR(v)[i] = 100 - i;
}
print_vector_format(&v, stdout, "%g");
igraph_vector_destroy(&v);
printf("Test igraph_vector_copy_to\n");
ptr = (igraph_real_t*) malloc(10 * sizeof(igraph_real_t));
igraph_vector_init_range(&v, 11, 21);
igraph_vector_copy_to(&v, ptr);
for (i = 0; i < 10; i++) {
printf(" %" IGRAPH_PRId "", (igraph_int_t)ptr[i]);
}
printf("\n");
free(ptr);
igraph_vector_destroy(&v);
printf("Test igraph_vector_init_range, igraph_vector_sum, igraph_vector_prod\n");
igraph_vector_init_range(&v, 1, 6);
printf(" %" IGRAPH_PRId "", (igraph_int_t)igraph_vector_sum(&v));
printf(" %" IGRAPH_PRId "\n", (igraph_int_t)igraph_vector_prod(&v));
printf("Test igraph_vector_remove_section\n");
igraph_vector_remove_section(&v, 2, 4);
print_vector_format(&v, stdout, "%g");
printf("Test igraph_vector_remove_section with invalid limits\n");
igraph_vector_remove_section(&v, -3, -1);
igraph_vector_remove_section(&v, 100, 120);
igraph_vector_remove_section(&v, 2, 0);
print_vector_format(&v, stdout, "%g");
igraph_vector_remove_section(&v, 1, 20);
print_vector_format(&v, stdout, "%g");
igraph_vector_destroy(&v);
printf("Test igraph_vector_remove\n");
igraph_vector_init_range(&v, 1, 11);
igraph_vector_remove(&v, 9);
igraph_vector_remove(&v, 0);
igraph_vector_remove(&v, 4);
print_vector_format(&v, stdout, "%g");
igraph_vector_destroy(&v);
printf("Test igraph_vector_remove_fast\n");
igraph_vector_init_range(&v, 1, 11);
igraph_vector_remove_fast(&v, 9);
igraph_vector_remove_fast(&v, 0);
igraph_vector_remove_fast(&v, 4);
print_vector_format(&v, stdout, "%g");
igraph_vector_destroy(&v);
printf("Test igraph_vector_move_interval\n");
igraph_vector_init_range(&v, 0, 10);
igraph_vector_move_interval(&v, 5, 10, 0);
print_vector_format(&v, stdout, "%g");
igraph_vector_destroy(&v);
printf("Test igraph_vector_isininterval\n");
igraph_vector_init_range(&v, 1, 11);
IGRAPH_ASSERT(igraph_vector_isininterval(&v, 1, 10));
IGRAPH_ASSERT(!igraph_vector_isininterval(&v, 2, 10));
IGRAPH_ASSERT(!igraph_vector_isininterval(&v, 1, 9));
printf("Test igraph_vector_any_smaller\n");
IGRAPH_ASSERT(!igraph_vector_any_smaller(&v, 1));
IGRAPH_ASSERT(igraph_vector_any_smaller(&v, 2));
igraph_vector_destroy(&v);
printf("Test igraph_vector_all_e\n");
printf("Test igraph_vector_binsearch\n");
igraph_vector_init_range(&v, 0, 10);
for (i = 0; i < igraph_vector_size(&v); i++) {
IGRAPH_ASSERT(igraph_vector_binsearch(&v, 0, 0));
}
IGRAPH_ASSERT(!igraph_vector_binsearch(&v, 10, 0));
IGRAPH_ASSERT(!igraph_vector_binsearch(&v, -1, 0));
for (i = 0; i < igraph_vector_size(&v); i++) {
VECTOR(v)[i] = 2 * i;
}
for (i = 0; i < igraph_vector_size(&v); i++) {
IGRAPH_ASSERT(igraph_vector_binsearch(&v, VECTOR(v)[i], &pos));
IGRAPH_ASSERT(pos == i);
IGRAPH_ASSERT(!igraph_vector_binsearch(&v, VECTOR(v)[i] + 1, &pos));
}
igraph_vector_destroy(&v);
printf("Test Binsearch in empty vector\n");
igraph_vector_init(&v, 0);
IGRAPH_ASSERT(!igraph_vector_contains_sorted(&v, 0));
IGRAPH_ASSERT(!igraph_vector_binsearch(&v, 1, &pos));
IGRAPH_ASSERT(pos == 0);
igraph_vector_destroy(&v);
printf("Test igraph_vector_init_real\n");
igraph_vector_init_real(&v, 10, 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0);
print_vector_format(&v, stdout, "%g");
igraph_vector_destroy(&v);
printf("Test igraph_vector_init_int\n");
igraph_vector_init_int(&v, 10, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10);
print_vector_format(&v, stdout, "%g");
igraph_vector_destroy(&v);
printf("Test igraph_vector_init_real\n");
igraph_vector_init_real_end(&v, -1, 1.0, 2.0, 3.0, 4.0, 5.0,
6.0, 7.0, 8.0, 9.0, 10.0, -1.0);
print_vector_format(&v, stdout, "%g");
igraph_vector_destroy(&v);
printf("Test igraph_vector_init_int\n");
igraph_vector_init_int_end(&v, -1, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, -1);
print_vector_format(&v, stdout, "%g");
igraph_vector_destroy(&v);
printf("Test filter_smaller, quite special....\n");
igraph_vector_init_int_end(&v, -1, 0, 1, 2, 3, 4, 4, 4, 4, 5, 6, 7, 8, -1);
igraph_vector_filter_smaller(&v, 4);
print_vector_format(&v, stdout, "%g");
igraph_vector_destroy(&v);
igraph_vector_init_int_end(&v, -1, 1, 2, 3, 4, 4, 4, 4, 5, 6, 7, 8, -1);
igraph_vector_filter_smaller(&v, 0);
print_vector_format(&v, stdout, "%g");
igraph_vector_destroy(&v);
igraph_vector_init_int_end(&v, -1, 0, 0, 1, 2, 3, 4, 4, 4, 4, 5, 6, 7, 8, -1);
igraph_vector_filter_smaller(&v, 0);
print_vector_format(&v, stdout, "%g");
igraph_vector_destroy(&v);
printf("Test igraph_i_vector_int_rank and igraph_i_vector_int_order\n");
igraph_vector_int_init_int_end(&v2, -1, 0, 1, 2, 6, 5, 2, 1, 0, -1);
igraph_vector_int_init(&v4, 0);
igraph_i_vector_int_rank(&v2, &v4, 7);
print_vector_int(&v2);
print_vector_int(&v4);
igraph_i_vector_int_order(&v2, &v4, 7);
print_vector_int(&v4);
igraph_vector_int_destroy(&v2);
igraph_vector_int_destroy(&v4);
printf("Test pair order\n");
igraph_vector_int_init_int_end(&v5, -1, 1, 1, 2, 2, -1);
igraph_vector_int_init_int_end(&v6, -1, 2, 3, 1, 3, -1);
igraph_vector_int_init(&v4, 0);
igraph_vector_int_pair_order(&v5, &v6, &v4, 3);
print_vector_int(&v4);
igraph_vector_int_destroy(&v5);
igraph_vector_int_destroy(&v6);
igraph_vector_int_destroy(&v4);
printf("Test fill\n");
igraph_vector_init(&v, 100);
igraph_vector_fill(&v, 1.234567);
for (i = 0; i < igraph_vector_size(&v); i++) {
IGRAPH_ASSERT(VECTOR(v)[i] == 1.234567);
}
igraph_vector_destroy(&v);
printf("Test range\n");
igraph_vector_init(&v, 100);
igraph_vector_range(&v, 20, 50);
IGRAPH_ASSERT(igraph_vector_size(&v) == 30);
for (i = 0; i < igraph_vector_size(&v); i++) {
IGRAPH_ASSERT(VECTOR(v)[i] == 20 + i);
}
igraph_vector_destroy(&v);
printf("Test igraph_vector_int_init_range, igraph_i_vector_int_order\n");
igraph_vector_int_init_range(&v4, 1, 11);
igraph_vector_int_reverse(&v4);
igraph_vector_int_scale(&v4, 3);
igraph_vector_int_init(&v5, 0);
igraph_i_vector_int_order(&v4, &v5, /* maxval */ igraph_vector_int_max(&v4));
print_vector_int(&v5);
igraph_vector_int_destroy(&v4);
igraph_vector_int_destroy(&v5);
VERIFY_FINALLY_STACK();
return 0;
}