bliss_C.h

Go to the documentation of this file.

#ifndef BLISS_C_H
#define BLISS_C_H

/*
  Copyright (c) 2003-2021 Tommi Junttila
  Released under the GNU Lesser General Public License version 3.
  
  This file is part of bliss.
  
  bliss is free software: you can redistribute it and/or modify
  it under the terms of the GNU Lesser General Public License as published by
  the Free Software Foundation, version 3 of the License.

  bliss 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 Lesser General Public License for more details.

  You should have received a copy of the GNU Lesser General Public License
  along with bliss.  If not, see <http://www.gnu.org/licenses/>.
*/

#include <stdlib.h>
#include <stdio.h>


typedef struct bliss_graph_struct BlissGraph;


typedef struct bliss_stats_struct
{
  long double group_size_approx;
  long unsigned int nof_nodes;
  long unsigned int nof_leaf_nodes;
  long unsigned int nof_bad_nodes;
  long unsigned int nof_canupdates;
  long unsigned int nof_generators;
  unsigned long int max_level;
} BlissStats;


BlissGraph *bliss_new(const unsigned int N);


BlissGraph *bliss_read_dimacs(FILE *fp);


void bliss_write_dimacs(BlissGraph *graph, FILE *fp);


void bliss_release(BlissGraph *graph);


void bliss_write_dot(BlissGraph *graph, FILE *fp);


unsigned int bliss_get_nof_vertices(BlissGraph *graph);


unsigned int bliss_add_vertex(BlissGraph *graph, unsigned int c);


void bliss_add_edge(BlissGraph *graph, unsigned int v1, unsigned int v2);


int bliss_cmp(BlissGraph *graph1, BlissGraph *graph2);


unsigned int bliss_hash(BlissGraph *graph);


BlissGraph *bliss_permute(BlissGraph *graph, const unsigned int *perm);


void
bliss_find_automorphisms(BlissGraph *graph,
             void (*hook)(void *user_param,
                      unsigned int N,
                      const unsigned int *aut),
             void *hook_user_param,
             BlissStats *stats);


const unsigned int *
bliss_find_canonical_labeling(BlissGraph *graph,
                  void (*hook)(void *user_param,
                       unsigned int N,
                       const unsigned int *aut),
                  void *hook_user_param,
                  BlissStats *stats);

#endif