The bliss C++ API
Here is a list of all documented class members with links to the class documentation for each member:
- a -
add_edge() :
bliss::AbstractGraph
,
bliss::Digraph
,
bliss::Graph
add_vertex() :
bliss::AbstractGraph
,
bliss::Digraph
,
bliss::Graph
assign() :
bliss::BigNum
- b -
BacktrackPoint :
bliss::Partition
BigNum() :
bliss::BigNum
- c -
canonical_form() :
bliss::AbstractGraph
change_color() :
bliss::AbstractGraph
,
bliss::Digraph
,
bliss::Graph
clear() :
bliss::Heap
,
bliss::KQueue< Type >
clear_ivs() :
bliss::Partition
cmp() :
bliss::Digraph
,
bliss::Graph
,
bliss::UintSeqHash
copy() :
bliss::Digraph
,
bliss::Graph
- d -
Digraph() :
bliss::Digraph
- f -
find_automorphisms() :
bliss::AbstractGraph
front() :
bliss::KQueue< Type >
- g -
get_cell() :
bliss::Partition
get_color() :
bliss::AbstractGraph
,
bliss::Digraph
,
bliss::Graph
get_duration() :
bliss::Timer
get_factors() :
bliss::BigNum
get_group_size() :
bliss::Stats
get_group_size_approx() :
bliss::Stats
get_hash() :
bliss::AbstractGraph
,
bliss::Digraph
,
bliss::Graph
get_max_level() :
bliss::Stats
get_minimal_representative() :
bliss::Orbit
get_nof_bad_nodes() :
bliss::Stats
get_nof_canupdates() :
bliss::Stats
get_nof_generators() :
bliss::Stats
get_nof_leaf_nodes() :
bliss::Stats
get_nof_nodes() :
bliss::Stats
get_nof_vertices() :
bliss::AbstractGraph
,
bliss::Digraph
,
bliss::Graph
get_value() :
bliss::UintSeqHash
goto_backtrack_point() :
bliss::Partition
Graph() :
bliss::Graph
group_size_approx :
bliss_stats_struct
- i -
individualize() :
bliss::Partition
init() :
bliss::KQueue< Type >
,
bliss::Orbit
,
bliss::Partition
insert() :
bliss::Heap
is_automorphism() :
bliss::AbstractGraph
,
bliss::Digraph
,
bliss::Graph
is_discrete() :
bliss::Partition
is_empty() :
bliss::Heap
,
bliss::KQueue< Type >
is_equal() :
bliss::UintSeqHash
is_in_splitting_queue() :
bliss::Partition::Cell
is_le() :
bliss::UintSeqHash
is_lt() :
bliss::UintSeqHash
is_minimal_representative() :
bliss::Orbit
is_unit() :
bliss::Partition::Cell
- k -
KQueue() :
bliss::KQueue< Type >
- m -
max_level :
bliss_stats_struct
merge_orbits() :
bliss::Orbit
multiply() :
bliss::BigNum
- n -
nof_bad_nodes :
bliss_stats_struct
nof_canupdates :
bliss_stats_struct
nof_generators :
bliss_stats_struct
nof_leaf_nodes :
bliss_stats_struct
nof_nodes :
bliss_stats_struct
nof_orbits() :
bliss::Orbit
- o -
Orbit() :
bliss::Orbit
orbit_size() :
bliss::Orbit
- p -
permute() :
bliss::AbstractGraph
,
bliss::Digraph
,
bliss::Graph
pop_back() :
bliss::KQueue< Type >
pop_front() :
bliss::KQueue< Type >
print() :
bliss::BigNum
,
bliss::Partition
,
bliss::Stats
print_signature() :
bliss::Partition
push_back() :
bliss::KQueue< Type >
push_front() :
bliss::KQueue< Type >
- r -
read_dimacs() :
bliss::Digraph
,
bliss::Graph
remove() :
bliss::Heap
reset() :
bliss::Orbit
,
bliss::Timer
,
bliss::UintSeqHash
- s -
set_backtrack_point() :
bliss::Partition
set_component_recursion() :
bliss::AbstractGraph
set_failure_recording() :
bliss::AbstractGraph
set_long_prune_activity() :
bliss::AbstractGraph
set_splitting_heuristic() :
bliss::Digraph
,
bliss::Graph
set_verbose_file() :
bliss::AbstractGraph
set_verbose_level() :
bliss::AbstractGraph
shs_f :
bliss::Digraph
,
bliss::Graph
shs_fl :
bliss::Digraph
,
bliss::Graph
shs_flm :
bliss::Digraph
,
bliss::Graph
shs_fm :
bliss::Digraph
,
bliss::Graph
shs_fs :
bliss::Digraph
,
bliss::Graph
shs_fsm :
bliss::Digraph
,
bliss::Graph
size() :
bliss::Heap
,
bliss::KQueue< Type >
smallest() :
bliss::Heap
SplittingHeuristic :
bliss::Digraph
,
bliss::Graph
- t -
Timer() :
bliss::Timer
to_string() :
bliss::BigNum
- u -
update() :
bliss::UintSeqHash
- w -
write_dimacs() :
bliss::AbstractGraph
,
bliss::Digraph
,
bliss::Graph
write_dot() :
bliss::AbstractGraph
,
bliss::Digraph
,
bliss::Graph
- ~ -
~BigNum() :
bliss::BigNum
~Digraph() :
bliss::Digraph
~Graph() :
bliss::Graph
Generated by
1.8.13