/* -*- mode: C -*-  */
/* 
   IGraph library.
   Copyright (C) 2013  Gabor Csardi <csardi.gabor@gmail.com>
   334 Harvard st, 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 sort_cmp(const void *a, const void *b) {
  const igraph_vector_t **da = (const igraph_vector_t **) a;
  const igraph_vector_t **db = (const igraph_vector_t **) b;
  int i, alen=igraph_vector_size(*da), blen=igraph_vector_size(*db);
  if (alen != blen) { return (alen < blen) - (alen > blen); }
  for (i=0; i<alen; i++) {
    int ea=VECTOR(**da)[i], eb=VECTOR(**db)[i];
    if (ea != eb) { return (ea > eb) - (ea < eb); }
  }
  return 0;
}

void sort_cliques(igraph_vector_ptr_t *cliques) {
  int i, n=igraph_vector_ptr_size(cliques);
  for (i=0; i<n; i++) {
    igraph_vector_t *v=VECTOR(*cliques)[i];
    igraph_vector_sort(v);
  }
  igraph_qsort(VECTOR(*cliques), (size_t) n,
	       sizeof(igraph_vector_t *), sort_cmp);
}

int print_and_destroy(igraph_vector_ptr_t *cliques) {
  int i, n=igraph_vector_ptr_size(cliques);
  sort_cliques(cliques);
  for (i=0; i<n; i++) {
    igraph_vector_t *v=VECTOR(*cliques)[i];
    igraph_vector_print(v);
    igraph_vector_destroy(v);
  }
  igraph_vector_ptr_destroy(cliques);
  return 0;
}

int main() {
  igraph_t graph;
  igraph_vector_ptr_t cliques, cl1, cl2;
  igraph_vector_int_t v1, v2;
  igraph_integer_t n, n1, n2;

  igraph_rng_seed(igraph_rng_default(), 42);
  igraph_erdos_renyi_game(&graph, IGRAPH_ERDOS_RENYI_GNP,
  			  /*n=*/ 100, /*p=*/ 0.5, /*directed=*/ 0,
  			  /*loops=*/ 0);

  igraph_vector_ptr_init(&cliques, 0);
  
  igraph_maximal_cliques_subset(&graph, /*subset=*/ 0, 
				&cliques, &n, /*outfile=*/ 0, 
				/*min_size=*/ 9, /*max_size=*/ 0);

  igraph_vector_int_init_seq(&v1,  0, 12);
  igraph_vector_int_init_seq(&v2, 13, 99);
  igraph_vector_ptr_init(&cl1, 0);
  igraph_vector_ptr_init(&cl2, 0);
  igraph_maximal_cliques_subset(&graph, &v1, &cl1, &n1, /*outfile=*/ 0, 
				/*min_size=*/ 9, /*max_size=*/ 0);
  igraph_maximal_cliques_subset(&graph, &v2, &cl2, &n2, /*outfile=*/ 0, 
				/*min_size=*/ 9, /*max_size=*/ 0);

  igraph_vector_int_destroy(&v1);
  igraph_vector_int_destroy(&v2);    

  if (n1 + n2 != n) { return 1; }
  if (n1 != igraph_vector_ptr_size(&cl1)) { return 2; }
  if (n2 != igraph_vector_ptr_size(&cl2)) { return 3; }
  
  print_and_destroy(&cliques);
  printf("---\n");
  print_and_destroy(&cl1);
  printf("+\n");
  print_and_destroy(&cl2);
  
  igraph_destroy(&graph);

  return 0;
}