agent_compositor_test/references/igraph-1.0.1/tests/unit/igraph_density.c

/*
   igraph library.
   Copyright (C) 2006-2013  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>

#include "test_utilities.h"

void test_density(const igraph_t *graph, igraph_bool_t loops) {
    igraph_real_t density;

    if (igraph_density(graph, NULL, &density, loops)) {
        printf("FAILED!\n");
        return;
    }

    if (isnan(density)) {
        printf("nan\n");
    } else {
        printf("%.4f\n", density);
    }
}

/* Assumes an attribute handler.
 *
 * Takes a multigraph, simplifies edges and records edge multiplicites
 * as "weights", then verifies that the density of the unweighted multigraph
 * is the same as the density of the weighted simplified graph.
 */
void test_weighted_density(const igraph_t *graph, igraph_bool_t loops) {
    igraph_t wg;
    igraph_vector_t weights;
    igraph_attribute_combination_t comb;
    igraph_real_t dens1, dens2;

    igraph_copy(&wg, graph);

    igraph_vector_init(&weights, igraph_ecount(graph));
    igraph_vector_fill(&weights, 1);
    SETEANV(&wg, "weight", &weights);

    igraph_attribute_combination(&comb,
                                 "weight", IGRAPH_ATTRIBUTE_COMBINE_SUM,
                                 IGRAPH_NO_MORE_ATTRIBUTES);

    igraph_simplify(&wg, /* remove_multiple */ true, /* remove_loops */ false, &comb);

    EANV(&wg, "weight", &weights);

    igraph_density(graph, NULL, &dens1, loops);
    igraph_density(&wg, &weights, &dens2, loops);

    IGRAPH_ASSERT(dens1 == dens2);

    igraph_attribute_combination_destroy(&comb);
    igraph_vector_destroy(&weights);
    igraph_destroy(&wg);
}

int main(void) {

    igraph_t g;
    igraph_vector_int_t v;

    igraph_vector_int_init(&v, 0);

    /* Test graphs with no vertices and no edges */
    igraph_create(&g, &v, 0, IGRAPH_UNDIRECTED);
    test_density(&g, false);
    test_density(&g, true);
    igraph_destroy(&g);
    igraph_create(&g, &v, 0, IGRAPH_DIRECTED);
    test_density(&g, false);
    test_density(&g, true);
    igraph_destroy(&g);
    printf("======\n");

    /* Test graphs with one vertex and no edges */
    igraph_create(&g, &v, 1, IGRAPH_UNDIRECTED);
    test_density(&g, false);
    test_density(&g, true);
    igraph_destroy(&g);
    igraph_create(&g, &v, 1, IGRAPH_DIRECTED);
    test_density(&g, false);
    test_density(&g, true);
    igraph_destroy(&g);
    printf("======\n");

    /* Test graphs with one vertex and a loop edge */
    igraph_vector_int_resize(&v, 2);
    VECTOR(v)[0] = 0;
    VECTOR(v)[1] = 0;
    igraph_create(&g, &v, 1, IGRAPH_UNDIRECTED);
    test_density(&g, true);
    igraph_destroy(&g);
    igraph_create(&g, &v, 1, IGRAPH_DIRECTED);
    test_density(&g, true);
    igraph_destroy(&g);
    printf("======\n");

    /* Test graphs with one vertex and two loop edges */
    igraph_vector_int_resize(&v, 4);
    VECTOR(v)[0] = 0;
    VECTOR(v)[1] = 0;
    VECTOR(v)[2] = 0;
    VECTOR(v)[3] = 0;
    igraph_create(&g, &v, 1, IGRAPH_UNDIRECTED);
    test_density(&g, true);
    igraph_destroy(&g);
    igraph_create(&g, &v, 1, IGRAPH_DIRECTED);
    test_density(&g, true);
    igraph_destroy(&g);
    printf("======\n");

    /* Test graphs with two vertices and one edge between them */
    igraph_vector_int_resize(&v, 2);
    VECTOR(v)[0] = 0;
    VECTOR(v)[1] = 1;
    igraph_create(&g, &v, 2, IGRAPH_UNDIRECTED);
    test_density(&g, false);
    test_density(&g, true);
    igraph_destroy(&g);
    igraph_create(&g, &v, 1, IGRAPH_DIRECTED);
    test_density(&g, false);
    test_density(&g, true);
    igraph_destroy(&g);
    printf("======\n");

    /* Test graphs with two vertices, one edge between them and a loop on one
     * of them */
    igraph_vector_int_resize(&v, 4);
    VECTOR(v)[0] = 0;
    VECTOR(v)[1] = 1;
    VECTOR(v)[2] = 1;
    VECTOR(v)[3] = 1;
    igraph_create(&g, &v, 2, IGRAPH_UNDIRECTED);
    test_density(&g, true);
    igraph_destroy(&g);
    igraph_create(&g, &v, 1, IGRAPH_DIRECTED);
    test_density(&g, true);
    igraph_destroy(&g);
    printf("======\n");

    /* Test graphs with two vertices, one edge between them and a loop on both
     * of them */
    igraph_vector_int_resize(&v, 6);
    VECTOR(v)[0] = 0;
    VECTOR(v)[1] = 1;
    VECTOR(v)[2] = 1;
    VECTOR(v)[3] = 1;
    VECTOR(v)[4] = 0;
    VECTOR(v)[5] = 0;
    igraph_create(&g, &v, 2, IGRAPH_UNDIRECTED);
    test_density(&g, true);
    igraph_destroy(&g);
    igraph_create(&g, &v, 1, IGRAPH_DIRECTED);
    test_density(&g, true);
    igraph_destroy(&g);
    printf("======\n");

    /* Zachary karate club graph */
    igraph_famous(&g, "zachary");
    test_density(&g, false);
    test_density(&g, true);
    igraph_destroy(&g);

    igraph_vector_int_destroy(&v);

    VERIFY_FINALLY_STACK();

    /* Test weighted density.
     * These tests require an attribute table and use randomness. */

    igraph_set_attribute_table(&igraph_cattribute_table);
    igraph_rng_seed(igraph_rng_default(), 1234);

    igraph_erdos_renyi_game_gnm(&g, 10, 30, IGRAPH_UNDIRECTED, IGRAPH_LOOPS_SW | IGRAPH_MULTI_SW, IGRAPH_EDGE_UNLABELED);
    test_weighted_density(&g, IGRAPH_LOOPS);
    igraph_destroy(&g);

    igraph_erdos_renyi_game_gnm(&g, 9, 30, IGRAPH_UNDIRECTED, IGRAPH_MULTI_SW, IGRAPH_EDGE_UNLABELED);
    test_weighted_density(&g, IGRAPH_LOOPS);
    igraph_destroy(&g);

    igraph_erdos_renyi_game_gnm(&g, 8, 30, IGRAPH_DIRECTED, IGRAPH_LOOPS_SW | IGRAPH_MULTI_SW, IGRAPH_EDGE_UNLABELED);
    test_weighted_density(&g, IGRAPH_LOOPS);
    igraph_destroy(&g);

    igraph_erdos_renyi_game_gnm(&g, 7, 30, IGRAPH_DIRECTED, IGRAPH_MULTI_SW, IGRAPH_EDGE_UNLABELED);
    test_weighted_density(&g, IGRAPH_LOOPS);
    igraph_destroy(&g);

    VERIFY_FINALLY_STACK();

    return 0;
}