/* -*- 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>

void print_vector(igraph_vector_t *v, FILE *f) {
    long int i;
    for (i = 0; i < igraph_vector_size(v); i++) {
        fprintf(f, " %li", (long int) VECTOR(*v)[i]);
    }
    fprintf(f, "\n");
}

int main() {

    igraph_t g;
    igraph_vector_t v;
    int ret;

    /* Create graph */
    igraph_vector_init(&v, 8);
    VECTOR(v)[0] = 0;
    VECTOR(v)[1] = 1;
    VECTOR(v)[2] = 1;
    VECTOR(v)[3] = 2;
    VECTOR(v)[4] = 2;
    VECTOR(v)[5] = 3;
    VECTOR(v)[6] = 2;
    VECTOR(v)[7] = 2;
    igraph_create(&g, &v, 0, 1);

    /* Add edges */
    igraph_vector_resize(&v, 4);
    VECTOR(v)[0] = 2;
    VECTOR(v)[1] = 1;
    VECTOR(v)[2] = 3;
    VECTOR(v)[3] = 3;
    igraph_add_edges(&g, &v, 0);

    /* Check result */
    igraph_get_edgelist(&g, &v, 0);
    igraph_vector_sort(&v);
    print_vector(&v, stdout);

    /* Error, vector length */
    igraph_set_error_handler(igraph_error_handler_ignore);
    igraph_vector_resize(&v, 3);
    VECTOR(v)[0] = 0;
    VECTOR(v)[1] = 1;
    VECTOR(v)[2] = 2;
    ret = igraph_add_edges(&g, &v, 0);
    if (ret != IGRAPH_EINVEVECTOR) {
        return 1;
    }

    /* Check result */
    igraph_get_edgelist(&g, &v, 0);
    igraph_vector_sort(&v);
    print_vector(&v, stdout);

    /* Error, vector ids */
    igraph_vector_resize(&v, 4);
    VECTOR(v)[0] = 0;
    VECTOR(v)[1] = 1;
    VECTOR(v)[2] = 2;
    VECTOR(v)[3] = 4;
    ret = igraph_add_edges(&g, &v, 0);
    if (ret != IGRAPH_EINVVID) {
        return 2;
    }

    /* Check result */
    igraph_get_edgelist(&g, &v, 0);
    igraph_vector_sort(&v);
    print_vector(&v, stdout);

    igraph_vector_destroy(&v);
    igraph_destroy(&g);

    return 0;
}