23 #include "abstractgraph.hh" 38 long double group_size_approx;
40 long unsigned int nof_nodes;
42 long unsigned int nof_leaf_nodes;
44 long unsigned int nof_bad_nodes;
46 long unsigned int nof_canupdates;
48 long unsigned int nof_generators;
50 unsigned long int max_level;
55 group_size_approx = 1.0;
66 size_t print(FILE*
const fp)
const 69 r += fprintf(fp,
"Nodes: %lu\n", nof_nodes);
70 r += fprintf(fp,
"Leaf nodes: %lu\n", nof_leaf_nodes);
71 r += fprintf(fp,
"Bad nodes: %lu\n", nof_bad_nodes);
72 r += fprintf(fp,
"Canrep updates: %lu\n", nof_canupdates);
73 r += fprintf(fp,
"Generators: %lu\n", nof_generators);
74 r += fprintf(fp,
"Max level: %lu\n", max_level);
75 r += fprintf(fp,
"|Aut|: ")+group_size.
print(fp)+fprintf(fp,
"\n");
long unsigned int get_nof_nodes() const
Definition: stats.hh:85
long double get_group_size_approx() const
Definition: stats.hh:83
A simple wrapper class for non-negative big integers (or approximation of them).
Definition: bignum.hh:117
Definition: abstractgraph.cc:35
long unsigned int get_nof_leaf_nodes() const
Definition: stats.hh:87
Statistics returned by the bliss search algorithm.
Definition: stats.hh:31
long unsigned int get_nof_bad_nodes() const
Definition: stats.hh:89
long unsigned int get_nof_canupdates() const
Definition: stats.hh:91
void assign(unsigned int n)
Definition: bignum.hh:139
size_t print(FILE *const fp) const
Definition: stats.hh:66
An abstract base class for different types of graphs.
Definition: abstractgraph.hh:47
long unsigned int get_nof_generators() const
Definition: stats.hh:93
size_t print(FILE *const fp) const
Definition: bignum.hh:156
const BigNum & get_group_size() const
Definition: stats.hh:80
unsigned long int get_max_level() const
Definition: stats.hh:95