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,70 @@
+/*
+   igraph library.
+   Copyright (C) 2010-2012  Gabor Csardi <csardi.gabor@gmail.com>
+   334 Harvard street, 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 <limits.h>
+
+int main(void) {
+
+    igraph_t g, gbar;
+    igraph_int_t k1, k2 = INT_MAX;
+    igraph_real_t tmpk;
+    igraph_int_t i, j, n;
+    igraph_maxflow_stats_t stats;
+
+    /* Initialize the library. */
+    igraph_setup();
+
+    igraph_famous(&g, "meredith");
+    igraph_even_tarjan_reduction(&g, &gbar, /*capacity=*/ NULL);
+
+    igraph_vertex_connectivity(&g, &k1, /* checks= */ false);
+
+    n = igraph_vcount(&g);
+    for (i = 0; i < n; i++) {
+        for (j = i + 1; j < n; j++) {
+            igraph_bool_t conn;
+            igraph_are_adjacent(&g, i, j, &conn);
+            if (conn) {
+                continue;
+            }
+            igraph_maxflow_value(&gbar, &tmpk,
+                                 /* source= */ i + n,
+                                 /* target= */ j,
+                                 /* capacity= */ 0,
+                                 &stats);
+            if (tmpk < k2) {
+                k2 = tmpk;
+            }
+        }
+    }
+
+    igraph_destroy(&gbar);
+    igraph_destroy(&g);
+
+    if (k1 != k2) {
+        printf("k1 = %" IGRAPH_PRId " while k2 = %" IGRAPH_PRId "\n", k1, k2);
+        return 1;
+    }
+
+    return 0;
+}