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,134 @@
+/*
+   igraph library.
+   Copyright (C) 2021  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_t graph, comp_graph;
+    igraph_bool_t is_perfect;
+    igraph_error_handler_t *ehandler;
+
+    igraph_rng_seed(igraph_rng_default(), 42);
+
+    // Bipartite
+    //==========================================================
+    igraph_bipartite_game_gnm(&graph, NULL, 10, 10, 20, IGRAPH_UNDIRECTED, IGRAPH_ALL, IGRAPH_SIMPLE_SW, IGRAPH_EDGE_UNLABELED);
+    igraph_is_perfect(&graph, &is_perfect);
+    IGRAPH_ASSERT(is_perfect);
+    igraph_destroy(&graph);
+
+    // Complement to star graph size 10 - chordal
+    //==========================================================
+    igraph_star(&graph, 10, IGRAPH_STAR_UNDIRECTED, 0);
+    igraph_complementer(&comp_graph, &graph, 0);
+    igraph_is_perfect(&comp_graph, &is_perfect);
+    IGRAPH_ASSERT(is_perfect);
+    igraph_destroy(&graph);
+    igraph_destroy(&comp_graph);
+
+    // A cycle of size 5
+    //==========================================================
+    igraph_ring(&graph, 5, IGRAPH_UNDIRECTED, 0, 1);
+    igraph_is_perfect(&graph, &is_perfect);
+    IGRAPH_ASSERT(!is_perfect);
+    igraph_destroy(&graph);
+
+    // A complement cycle of size 7
+    //==========================================================
+    igraph_ring(&graph, 7, IGRAPH_UNDIRECTED, 0, 1);
+    igraph_complementer(&comp_graph, &graph, 0);
+    igraph_is_perfect(&comp_graph, &is_perfect);
+    IGRAPH_ASSERT(!is_perfect);
+    igraph_destroy(&graph);
+    igraph_destroy(&comp_graph);
+
+    // A random tree
+    //==========================================================
+    igraph_tree_game(&graph, 10, IGRAPH_UNDIRECTED, IGRAPH_RANDOM_TREE_PRUFER);
+    igraph_is_perfect(&graph, &is_perfect);
+    IGRAPH_ASSERT(is_perfect);
+    igraph_destroy(&graph);
+
+    // 4X4 grid
+    //==========================================================
+    igraph_vector_int_t dims;
+    igraph_vector_int_init(&dims, 2);
+    VECTOR(dims)[0] = 4;
+    VECTOR(dims)[1] = 4;
+    igraph_square_lattice(&graph, &dims, 1, IGRAPH_UNDIRECTED, /* mutual */ 0, /* periodic */ 0);
+    igraph_is_perfect(&graph, &is_perfect);
+    IGRAPH_ASSERT(is_perfect);
+    igraph_destroy(&graph);
+    igraph_vector_int_destroy(&dims);
+
+    // Paley graph of order 9
+    //==========================================================
+    igraph_small(&graph, 9, IGRAPH_UNDIRECTED,
+                 0, 1, 0, 3, 0, 6, 0, 2, 1, 2, 1, 4, 1, 7, 2, 5, 2, 8,
+                 3, 4, 3, 5, 3, 6, 4, 5, 4, 7, 5, 8, 6, 7, 7, 8, 6, 8, -1);
+    igraph_is_perfect(&graph, &is_perfect);
+    IGRAPH_ASSERT(is_perfect);
+    igraph_destroy(&graph);
+
+    // famous graph - chvatal
+    //==========================================================
+    igraph_famous(&graph, "Chvatal");
+    igraph_is_perfect(&graph, &is_perfect);
+    IGRAPH_ASSERT(!is_perfect);
+    igraph_destroy(&graph);
+
+    // famous graph - house
+    //==========================================================
+    igraph_famous(&graph, "House");
+    igraph_is_perfect(&graph, &is_perfect);
+    IGRAPH_ASSERT(is_perfect);
+    igraph_destroy(&graph);
+
+    // Null graph
+    //==========================================================
+    igraph_empty(&graph, 0, IGRAPH_UNDIRECTED);
+    igraph_is_perfect(&graph, &is_perfect);
+    IGRAPH_ASSERT(is_perfect);
+    igraph_destroy(&graph);
+
+    // Singleton graph
+    //==========================================================
+    igraph_empty(&graph, 1, IGRAPH_UNDIRECTED);
+    igraph_is_perfect(&graph, &is_perfect);
+    IGRAPH_ASSERT(is_perfect);
+    igraph_destroy(&graph);
+
+    // Empty graph
+    //==========================================================
+    igraph_empty(&graph, 2, IGRAPH_UNDIRECTED);
+    igraph_is_perfect(&graph, &is_perfect);
+    IGRAPH_ASSERT(is_perfect);
+    igraph_destroy(&graph);
+
+    // Test directed paths
+    igraph_bipartite_game_gnm(&graph, NULL, 10, 10, 20, IGRAPH_DIRECTED, IGRAPH_ALL, IGRAPH_SIMPLE_SW, IGRAPH_EDGE_UNLABELED);
+    ehandler = igraph_set_error_handler(igraph_error_handler_printignore);
+    IGRAPH_ASSERT(igraph_is_perfect(&graph, &is_perfect) == IGRAPH_EINVAL);
+    igraph_set_error_handler(ehandler);
+    igraph_destroy(&graph);
+
+    VERIFY_FINALLY_STACK();
+
+    return 0;
+}