Statistics returned by the bliss search algorithm.
More...
#include <graph.hh>
Statistics returned by the bliss search algorithm.
| long double bliss::Stats::get_group_size_approx |
( |
| ) |
const |
|
inline |
An approximation (due to possible overflows/rounding errors) of the size of the automorphism group.
| unsigned long int bliss::Stats::get_max_level |
( |
| ) |
const |
|
inline |
The maximal depth of the search tree.
| long unsigned int bliss::Stats::get_nof_bad_nodes |
( |
| ) |
const |
|
inline |
The number of bad nodes in the search tree.
| long unsigned int bliss::Stats::get_nof_canupdates |
( |
| ) |
const |
|
inline |
The number of canonical representative updates.
| long unsigned int bliss::Stats::get_nof_generators |
( |
| ) |
const |
|
inline |
The number of generator permutations.
| long unsigned int bliss::Stats::get_nof_leaf_nodes |
( |
| ) |
const |
|
inline |
The number of leaf nodes in the search tree.
| long unsigned int bliss::Stats::get_nof_nodes |
( |
| ) |
const |
|
inline |
The number of nodes in the search tree.
| size_t bliss::Stats::print |
( |
FILE *const |
fp | ) |
const |
|
inline |
The documentation for this class was generated from the following file:
