/* -*- mode: C -*- */ /* IGraph library. Copyright (C) 2006-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> int main() { igraph_t g; igraph_vector_t outdeg, indeg, vec; igraph_bool_t is_simple; igraph_vector_init_real(&outdeg, 10, 3.0, 3.0, 3.0, 3.0, 3.0, 3.0, 3.0, 3.0, 3.0, 3.0); igraph_vector_init_real(&indeg, 10, 4.0, 4.0, 2.0, 2.0, 4.0, 4.0, 2.0, 2.0, 3.0, 3.0); igraph_vector_init(&vec, 0); /* checking the simple method, undirected graphs */ igraph_degree_sequence_game(&g, &outdeg, 0, IGRAPH_DEGSEQ_SIMPLE); if (igraph_is_directed(&g) || igraph_vcount(&g) != 10) return 1; if (igraph_degree(&g, &vec, igraph_vss_all(), IGRAPH_OUT, 1)) return 2; igraph_vector_print(&vec); igraph_destroy(&g); /* checking the Viger-Latapy method, undirected graphs */ igraph_degree_sequence_game(&g, &outdeg, 0, IGRAPH_DEGSEQ_VL); if (igraph_is_directed(&g) || igraph_vcount(&g) != 10) return 3; if (igraph_is_simple(&g, &is_simple) || !is_simple) return 4; if (igraph_degree(&g, &vec, igraph_vss_all(), IGRAPH_OUT, 0)) return 5; igraph_vector_print(&vec); igraph_destroy(&g); /* checking the simple method, directed graphs */ igraph_degree_sequence_game(&g, &outdeg, &indeg, IGRAPH_DEGSEQ_SIMPLE); if (!igraph_is_directed(&g) || igraph_vcount(&g) != 10) return 6; if (igraph_degree(&g, &vec, igraph_vss_all(), IGRAPH_OUT, 1)) return 7; igraph_vector_print(&vec); if (igraph_degree(&g, &vec, igraph_vss_all(), IGRAPH_IN, 1)) return 8; igraph_vector_print(&vec); igraph_destroy(&g); /* checking the no multiple edges method, undirected graphs */ igraph_degree_sequence_game(&g, &outdeg, 0, IGRAPH_DEGSEQ_SIMPLE_NO_MULTIPLE); if (igraph_is_directed(&g) || igraph_vcount(&g) != 10) return 9; if (igraph_is_simple(&g, &is_simple) || !is_simple) return 10; if (igraph_degree(&g, &vec, igraph_vss_all(), IGRAPH_OUT, 1)) return 11; igraph_vector_print(&vec); igraph_destroy(&g); /* checking the no multiple edges method, directed graphs */ igraph_degree_sequence_game(&g, &outdeg, &indeg, IGRAPH_DEGSEQ_SIMPLE_NO_MULTIPLE); if (!igraph_is_directed(&g) || igraph_vcount(&g) != 10) return 12; if (igraph_is_simple(&g, &is_simple) || !is_simple) return 13; if (igraph_degree(&g, &vec, igraph_vss_all(), IGRAPH_OUT, 1)) return 14; igraph_vector_print(&vec); if (igraph_degree(&g, &vec, igraph_vss_all(), IGRAPH_IN, 1)) return 15; igraph_vector_print(&vec); igraph_destroy(&g); igraph_vector_destroy(&vec); igraph_vector_destroy(&outdeg); igraph_vector_destroy(&indeg); return 0; }