/*

   igraph library.

   Copyright (C) 2024  The igraph development team

   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>

#include <cstdlib>

extern "C" int LLVMFuzzerTestOneInput(const uint8_t *Data, size_t Size) {

    igraph_t graph;

    igraph_vector_int_t edges;

    igraph_set_warning_handler(igraph_warning_handler_ignore);

    if (Size % 2 == 0 || Size > 512+1 || Size < 1) {

        return 0;

    }

    igraph_vector_int_init(&edges, Size-1);

    for (size_t i=0; i < Size-1; ++i) {

        VECTOR(edges)[i] = Data[i+1];

    }

    /* Undirected */

    if (igraph_create(&graph, &edges, Data[0], IGRAPH_UNDIRECTED) == IGRAPH_SUCCESS) {

        igraph_bool_t bres, bres2, bres3;

        igraph_real_t r;

        igraph_has_multiple(&graph, &bres);

        igraph_has_loop(&graph, &bres2);

        igraph_invalidate_cache(&graph);

        igraph_is_simple(&graph, &bres3, IGRAPH_DIRECTED);

        igraph_invalidate_cache(&graph);

        IGRAPH_ASSERT((bres || bres2) == !bres3);

        igraph_is_complete(&graph, &bres);

        igraph_invalidate_cache(&graph);

        igraph_is_bipartite(&graph, &bres, NULL);

        igraph_invalidate_cache(&graph);

        igraph_is_connected(&graph, &bres, IGRAPH_WEAK);

        igraph_invalidate_cache(&graph);

        igraph_is_acyclic(&graph, &bres);

        igraph_invalidate_cache(&graph);

        igraph_is_tree(&graph, &bres, NULL, IGRAPH_ALL);

        igraph_invalidate_cache(&graph);

        igraph_is_eulerian(&graph, &bres, &bres2);

        igraph_invalidate_cache(&graph);

        igraph_is_biconnected(&graph, &bres);

        igraph_invalidate_cache(&graph);

        igraph_is_chordal(&graph, NULL, NULL, &bres, NULL, NULL);

        igraph_invalidate_cache(&graph);

        igraph_density(&graph, NULL, &r, true);

        igraph_destroy(&graph);

    }

    igraph_vector_int_destroy(&edges);

    IGRAPH_ASSERT(IGRAPH_FINALLY_STACK_EMPTY);

    return 0;  // Non-zero return values are reserved for future use.

}