MinLCA algorithms
|
Class describing a cycle of cliques. More...
#include <cliques.hh>
Public Member Functions | |
virtual Graph & | init (int s, int c) |
Initialise the generator. | |
virtual void | generate () |
![]() | |
int | cliqueOrder () const |
Retrieve the order of each clique. More... | |
int | cliques () const |
Retrieve the number of cliques. More... | |
Protected Types | |
typedef CliqueCycle< BaseGraph > | Graph |
typedef CliqueSet< BaseGraph > | Base |
![]() | |
typedef CliqueSet< BaseGraph > | Graph |
Additional Inherited Members | |
![]() | |
int | _s |
Order of each clique. | |
int | _c |
Number of cliques. | |
Class describing a cycle of cliques.
Read the report of Bachelor's Thesis Algorithms for the linear colouring arrangement problem for more information.
Definition at line 74 of file cliques.hh.