/* -*- 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 v1, v2;
    int ret;

    /* simple use */
    igraph_vector_init(&v1, 8);
    VECTOR(v1)[0] = 0;
    VECTOR(v1)[1] = 1;
    VECTOR(v1)[2] = 1;
    VECTOR(v1)[3] = 2;
    VECTOR(v1)[4] = 2;
    VECTOR(v1)[5] = 3;
    VECTOR(v1)[6] = 2;
    VECTOR(v1)[7] = 2;
    igraph_create(&g, &v1, 0, 0);
    if (igraph_vcount(&g) != 4) {
        return 1;
    }
    igraph_vector_init(&v2, 0);
    igraph_get_edgelist(&g, &v2, 0);
    igraph_vector_sort(&v1);
    igraph_vector_sort(&v2);
    if (!igraph_vector_all_e(&v1, &v2)) {
        return 2;
    }
    igraph_destroy(&g);

    /* higher number of vertices */
    igraph_create(&g, &v1, 10, 0);
    if (igraph_vcount(&g) != 10) {
        return 1;
    }
    igraph_get_edgelist(&g, &v2, 0);
    igraph_vector_sort(&v1);
    igraph_vector_sort(&v2);
    if (!igraph_vector_all_e(&v1, &v2)) {
        return 3;
    }
    igraph_destroy(&g);

    /* error: IGRAPH_EINVEVECTOR */
    igraph_set_error_handler(igraph_error_handler_ignore);
    igraph_vector_resize(&v1, 9);
    VECTOR(v1)[8] = 0;
    ret = igraph_create(&g, &v1, 0, 0);
    if (ret != IGRAPH_EINVEVECTOR) {
        return 4;
    }

    /* error: IGRAPH_EINVVID */
    igraph_vector_resize(&v1, 8);
    VECTOR(v1)[7] = -1;
    ret = igraph_create(&g, &v1, 10, 1);
    if (ret != IGRAPH_EINVVID) {
        return 5;
    }
    igraph_vector_destroy(&v1);
    igraph_vector_destroy(&v2);

    return 0;
}