MinLCA algorithms
Public Member Functions | Protected Types | List of all members
minlca::utils::CliqueCycle< BaseGraph > Class Template Reference

Class describing a cycle of cliques. More...

#include <cliques.hh>

Inheritance diagram for minlca::utils::CliqueCycle< BaseGraph >:
[legend]
Collaboration diagram for minlca::utils::CliqueCycle< BaseGraph >:
[legend]

Public Member Functions

virtual Graphinit (int s, int c)
 Initialise the generator.
 
virtual void generate ()
 
- Public Member Functions inherited from minlca::utils::CliqueSet< BaseGraph >
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
 
- Protected Types inherited from minlca::utils::CliqueSet< BaseGraph >
typedef CliqueSet< BaseGraph > Graph
 

Additional Inherited Members

- Protected Attributes inherited from minlca::utils::CliqueSet< BaseGraph >
int _s
 Order of each clique.
 
int _c
 Number of cliques.
 

Detailed Description

template<typename BaseGraph = lemon::SmartGraph>
class minlca::utils::CliqueCycle< BaseGraph >

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.


The documentation for this class was generated from the following file: