PandA-2024.02
|
second fast version of the TTT_based_clique_covering. More...
#include <clique_covering.hpp>
Public Member Functions | |
TTT_based_clique_covering_fast (bool _all_edges, unsigned int nvert) | |
constructor More... | |
void | do_clique_covering (const cc_compatibility_graphRef CG, typename boost::disjoint_sets< rank_pmap_type, pred_pmap_type > &ds, CustomUnorderedSet< C_vertex > &support, const CustomUnorderedSet< C_vertex > &all_vertices, const filter_clique< vertex_type > &fc) override |
Public Member Functions inherited from coloring_based_clique_covering< vertex_type > | |
coloring_based_clique_covering (bool _all_edges, unsigned int nvert) | |
constructor More... | |
~coloring_based_clique_covering () override=default | |
destructor More... | |
C_vertex | add_vertex (const vertex_type &element, const std::string &name) override |
add a vertex More... | |
void | add_edge (const vertex_type &src, const vertex_type &dest, int _weight) override |
add an edge More... | |
size_t | num_vertices () override |
return the number of vertices of the clique More... | |
CustomOrderedSet< vertex_type > | get_clique (unsigned int i) override |
Returns a clique. More... | |
void | build_partitions (CustomUnorderedSet< C_vertex > &support, boost::disjoint_sets< rank_pmap_type, pred_pmap_type > &ds, std::map< C_vertex, CustomOrderedSet< C_vertex >> ¤t_partitions) |
build partitions More... | |
void | exec (const filter_clique< vertex_type > &fc, check_clique< vertex_type > &) override |
Abstract method that will execute clique covering algorithm. More... | |
void | writeDot (const std::string &filename) const override |
Writes a dotty representation of the actual graph. More... | |
void | add_subpartitions (size_t, vertex_type) override |
add subpartitions over which bipartite matching can start on More... | |
void | suggest_min_resources (size_t) override |
suggest that the problem have at least a given number of resources More... | |
void | suggest_max_resources (size_t) override |
suggest that the problem have at worst no more than the given number of resources More... | |
void | min_resources (size_t) override |
specify the minimum number of resources More... | |
void | max_resources (size_t) override |
specify the maximum number of resources More... | |
Public Member Functions inherited from clique_covering< vertex_type > | |
clique_covering ()=default | |
Default constructor. More... | |
virtual | ~clique_covering ()=default |
Destructor. More... | |
Additional Inherited Members | |
Static Public Member Functions inherited from clique_covering< vertex_type > | |
static refcount< clique_covering< vertex_type > > | create_solver (CliqueCovering_Algorithm solver, unsigned int nvert) |
Creates a reference to desired solver. More... | |
Protected Attributes inherited from coloring_based_clique_covering< vertex_type > | |
CustomUnorderedMap< C_vertex, vertex_type > | uv2v |
map between C_vertex and vertex_type More... | |
CustomUnorderedMap< C_vertex, std::string > | names |
name map for the C_vertex vertices More... | |
second fast version of the TTT_based_clique_covering.
The first maximal clique found is used by the greedy clique covering.
Definition at line 1046 of file clique_covering.hpp.
|
inlineexplicit |
constructor
Definition at line 1050 of file clique_covering.hpp.
|
inlineoverridevirtual |
do some filtering
check trivial cases
Reimplemented from coloring_based_clique_covering< vertex_type >.
Definition at line 1055 of file clique_covering.hpp.
References TTT_maximal_weighted_clique_fast< Graph >::get_weighted_maximal_cliques(), filter_clique< vertex_type >::select_candidate_to_remove(), and THROW_ASSERT.