PandA-2024.02
|
Functor used to reduce the size of clique: the rationale of filtering is that too many sharing may create problem to the timing closure of the design. More...
#include <clique_covering.hpp>
Public Member Functions | |
virtual | ~filter_clique ()=default |
virtual bool | select_candidate_to_remove (const CustomOrderedSet< C_vertex > &candidate_clique, C_vertex &v, const CustomUnorderedMap< C_vertex, vertex_type > &converter, const cc_compatibility_graph &cg) const =0 |
virtual size_t | clique_cost (const CustomOrderedSet< C_vertex > &candidate_clique, const CustomUnorderedMap< C_vertex, vertex_type > &converter) const =0 |
virtual bool | is_filtering () const =0 |
Functor used to reduce the size of clique: the rationale of filtering is that too many sharing may create problem to the timing closure of the design.
Definition at line 103 of file clique_covering.hpp.
|
virtualdefault |
|
pure virtual |
Implemented in slack_based_filtering, and no_filter_clique< vertex_type >.
Referenced by RTS_based_clique_covering< vertex_type >::compute_cost(), and bipartite_matching_clique_covering< vertex_type >::exec().
|
pure virtual |
Implemented in slack_based_filtering, and no_filter_clique< vertex_type >.
Referenced by TS_based_clique_covering< vertex_type >::is_non_compliant().
|
pure virtual |
Implemented in slack_based_filtering, and no_filter_clique< vertex_type >.
Referenced by TTT_based_clique_covering_fast< vertex_type >::do_clique_covering(), TTT_based_clique_covering< vertex_type >::do_clique_covering(), bipartite_matching_clique_covering< vertex_type >::exec(), and TS_based_clique_covering< vertex_type >::is_non_compliant().