179             void (*hook)(
void *user_param,
 
  181                      const unsigned int *aut),
 
  182             void *hook_user_param,
 
  199                  void (*hook)(
void *user_param,
 
  201                       const unsigned int *aut),
 
  202                  void *hook_user_param,
 
BlissGraph * bliss_read_dimacs(FILE *fp)
Definition: bliss_C.cc:46
 
void bliss_release(BlissGraph *graph)
Definition: bliss_C.cc:66
 
void bliss_add_edge(BlissGraph *graph, unsigned int v1, unsigned int v2)
Definition: bliss_C.cc:99
 
unsigned int bliss_hash(BlissGraph *graph)
Definition: bliss_C.cc:117
 
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)
 
int bliss_cmp(BlissGraph *graph1, BlissGraph *graph2)
Definition: bliss_C.cc:107
 
BlissGraph * bliss_permute(BlissGraph *graph, const unsigned int *perm)
Definition: bliss_C.cc:125
 
void bliss_write_dot(BlissGraph *graph, FILE *fp)
Definition: bliss_C.cc:75
 
BlissGraph * bliss_new(const unsigned int N)
Definition: bliss_C.cc:36
 
unsigned int bliss_add_vertex(BlissGraph *graph, unsigned int c)
Definition: bliss_C.cc:91
 
unsigned int bliss_get_nof_vertices(BlissGraph *graph)
Definition: bliss_C.cc:83
 
void bliss_write_dimacs(BlissGraph *graph, FILE *fp)
Definition: bliss_C.cc:58
 
struct bliss_stats_struct BlissStats
The C API version of the statistics returned by the bliss search algorithm.
 
The true bliss graph is hiding in this struct.
Definition: bliss_C.cc:31
 
The C API version of the statistics returned by the bliss search algorithm.
Definition: bliss_C.h:47
 
unsigned long int max_level
The maximal depth of the search tree.
Definition: bliss_C.h:64
 
long unsigned int nof_bad_nodes
The number of bad nodes in the search tree.
Definition: bliss_C.h:58
 
long unsigned int nof_canupdates
The number of canonical representative updates.
Definition: bliss_C.h:60
 
long unsigned int nof_generators
The number of generator permutations.
Definition: bliss_C.h:62
 
long unsigned int nof_leaf_nodes
The number of leaf nodes in the search tree.
Definition: bliss_C.h:56
 
long unsigned int nof_nodes
The number of nodes in the search tree.
Definition: bliss_C.h:54
 
long double group_size_approx
An approximation (due to possible rounding errors) of the size of the automorphism group.
Definition: bliss_C.h:52