Classes | |
class | BigNum |
A very simple class for big integers (or approximation of them). More... | |
class | Stats |
Statistics returned by the bliss search algorithm. More... | |
class | AbstractGraph |
An abstract base class for different types of graphs. More... | |
class | Graph |
The class for undirected, vertex colored graphs. More... | |
class | Digraph |
The class for directed, vertex colored graphs. More... | |
Functions | |
void | print_permutation (FILE *const fp, const unsigned int N, const unsigned int *perm, const unsigned int offset) |
void | print_permutation (FILE *const fp, const std::vector< unsigned int > &perm, const unsigned int offset) |
bool | is_permutation (const unsigned int N, const unsigned int *perm) |
bool | is_permutation (const std::vector< unsigned int > &perm) |
The namespace bliss contains all the classes and functions of the bliss tool except for the C programming language API.
bool bliss::is_permutation | ( | const unsigned int | N, |
const unsigned int * | perm | ||
) |
Check whether perm is a valid permutation on {0,...,N-1}. Slow, mainly for debugging and validation purposes.
bool bliss::is_permutation | ( | const std::vector< unsigned int > & | perm | ) |
Check whether perm is a valid permutation on {0,...,N-1}. Slow, mainly for debugging and validation purposes.
void bliss::print_permutation | ( | FILE * | fp, |
const unsigned int | N, | ||
const unsigned int * | perm, | ||
const unsigned int | offset = 0 |
||
) |
Print the permutation perm of {0,...,N-1} in the cycle format in the file stream fp. The amount offset is added to each element before printing, e.g. the permutation (2 4) is printed as (3 5) when offset is 1.
void bliss::print_permutation | ( | FILE * | fp, |
const std::vector< unsigned int > & | perm, | ||
const unsigned int | offset = 0 |
||
) |
Print the permutation perm of {0,...,N-1} in the cycle format in the file stream fp. The amount offset is added to each element before printing, e.g. the permutation (2 4) is printed as (3 5) when offset is 1.