2.2. igraph_bliss_info_t — Information about a BLISS run

2.2. `igraph_bliss_info_t` — Information about a BLISS run

typedef struct igraph_bliss_info_t {
  unsigned long nof_nodes;
  unsigned long nof_leaf_nodes;
  unsigned long nof_bad_nodes;
  unsigned long nof_canupdates;
  unsigned long max_level;
  char *group_size;
} igraph_bliss_info_t;

Some secondary information found by the BLISS algorithm is stored here. It is useful if you wany to study the internal working of the algorithm.

Values:

`nof_nodes`:	The number of nodes in the search tree.
`nof_leaf_nodes`:	The number of leaf nodes in the search tree.
`nof_bad_nodes`:	Number of bad nodes.
`nof_canupdates`:	Number of canrep updates.
`max_level`:	Maximum level.
`group_size`:	The size of the automorphism group of the graph, given as a string. It should be deallocated via `free()` if not needed any more.

See http://www.tcs.hut.fi/Software/bliss/index.html for details about the algorithm and these parameters.