/*
   igraph library.
   Copyright (C) 2024  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 <stdio.h>

#include "test_utilities.h"

int main(void) {
    igraph_t left, right, joined;

    /* Standard join. */
    printf("Standard join.\n");
    igraph_small(&left, 4, IGRAPH_UNDIRECTED, 0,1, 1,2, 2,2, -1);
    igraph_small(&right, 5, IGRAPH_UNDIRECTED, 0,1, 1,2, 2,2, 2,4, -1);

    igraph_join(&joined, &left, &right);
    print_graph(&joined);
    printf("\n");

    igraph_destroy(&left);
    igraph_destroy(&right);
    igraph_destroy(&joined);

    /* Standard directed join */
    printf("Standard directed join.\n");
    igraph_small(&left, 2, IGRAPH_DIRECTED, 0,1, -1);
    igraph_small(&right, 3, IGRAPH_DIRECTED, 0,1, 2,1, -1);

    igraph_join(&joined, &left, &right);
    print_graph(&joined);
    printf("\n");

    igraph_destroy(&left);
    igraph_destroy(&right);
    igraph_destroy(&joined);

    /* Empty graphs; the result is the null graph. */
    igraph_small(&left, 0, IGRAPH_UNDIRECTED, -1);
    igraph_small(&right, 0, IGRAPH_UNDIRECTED, -1);
    igraph_join(&joined, &left, &right);
    IGRAPH_ASSERT(igraph_ecount(&joined) != 0 || igraph_vcount(&joined) != 0);

    igraph_destroy(&left);
    igraph_destroy(&right);
    igraph_destroy(&joined);

    /* Empty graph joined with non-empty; the result is the non-empty. */
    igraph_small(&left, 4, IGRAPH_UNDIRECTED, 0,1, 1,2, 2,2, -1);
    igraph_small(&right, 0, IGRAPH_UNDIRECTED, -1);
    igraph_join(&joined, &left, &right);
    IGRAPH_ASSERT(igraph_ecount(&joined) != igraph_ecount(&left)
                  || igraph_vcount(&joined) != igraph_vcount(&left));

    igraph_destroy(&left);
    igraph_destroy(&right);
    igraph_destroy(&joined);

    VERIFY_FINALLY_STACK();

    return 0;
}