Add graph references

2026-06-28 13:49:01 +01:00
parent 0a9807e448
commit a11edf0c53
2578 changed files with 868045 additions and 0 deletions
@@ -0,0 +1,98 @@
+/* -*- mode: C++ -*-  */
+/*
+   igraph library.
+   Copyright (C) 2011-2012  Gabor Csardi <csardi.gabor@gmail.com>
+   334 Harvard st, Cambridge MA, 02139 USA
+
+   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, write to the Free Software
+   Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA
+   02110-1301 USA
+
+*/
+
+#include <igraph.h>
+#include <stdio.h>
+
+#include "test_utilities.h"
+
+int main(void) {
+    igraph_t karate;
+    igraph_vector_int_t parents;
+    igraph_vector_t weights;
+    igraph_int_t i, n;
+
+    igraph_rng_seed(igraph_rng_default(), 42);
+
+    igraph_small(&karate, 34, IGRAPH_UNDIRECTED,
+                 0, 1, 0, 2, 0, 3, 0, 4, 0, 5, 0, 6, 0, 7, 0, 8, 0, 10, 0, 11, 0, 12, 0, 13,
+                 0, 17, 0, 19, 0, 21, 0, 31,
+                 1, 2, 1, 3, 1, 7, 1, 13, 1, 17, 1, 19, 1, 21, 1, 30,
+                 2, 3, 2, 7, 2, 27, 2, 28, 2, 32, 2, 9, 2, 8, 2, 13,
+                 3, 7, 3, 12, 3, 13,
+                 4, 6, 4, 10,
+                 5, 6, 5, 10, 5, 16,
+                 6, 16,
+                 8, 30, 8, 32, 8, 33,
+                 9, 33,
+                 13, 33,
+                 14, 32, 14, 33,
+                 15, 32, 15, 33,
+                 18, 32, 18, 33,
+                 19, 33,
+                 20, 32, 20, 33,
+                 22, 32, 22, 33,
+                 23, 25, 23, 27, 23, 32, 23, 33, 23, 29,
+                 24, 25, 24, 27, 24, 31,
+                 25, 31,
+                 26, 29, 26, 33,
+                 27, 33,
+                 28, 31, 28, 33,
+                 29, 32, 29, 33,
+                 30, 32, 30, 33,
+                 31, 32, 31, 33,
+                 32, 33,
+                 -1);
+
+    igraph_vector_int_init(&parents, 0);
+    igraph_vector_init(&weights, 0);
+    igraph_hrg_consensus(&karate, &parents, &weights, /* hrg= */ NULL,
+                         /* start= */ false, /* num_samples= */ 100);
+
+    /* We do some simple validity tests on the results only; the exact results
+     * are different on i386 vs other platforms due to numerical inaccuracies */
+    if (igraph_vector_size(&weights) + igraph_vcount(&karate) != igraph_vector_int_size(&parents)) {
+        fprintf(stderr, "Vector length mismatch: %" IGRAPH_PRId " + %" IGRAPH_PRId " != %" IGRAPH_PRId "\n",
+            igraph_vector_size(&weights), igraph_vcount(&karate),
+            igraph_vector_int_size(&parents)
+        );
+        IGRAPH_FATAL("Vector length mismatch.");
+    }
+
+    n = igraph_vector_int_size(&parents);
+    for (i = 0; i < n; i++) {
+        if (VECTOR(parents)[i] < -1 || VECTOR(parents)[i] >= igraph_vcount(&karate) + igraph_vector_size(&weights)) {
+            fprintf(stderr, "Invalid parents vector:\n");
+            igraph_vector_int_fprint(&parents, stderr);
+            IGRAPH_FATAL("Invalid parents vector.");
+        }
+    }
+
+    igraph_vector_int_destroy(&parents);
+    igraph_vector_destroy(&weights);
+    igraph_destroy(&karate);
+
+    VERIFY_FINALLY_STACK();
+
+    return 0;
+}