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

Class describing a random graph with cliques. More...

#include <cliques.hh>

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

Public Member Functions

template<typename Number = int>
 CliqueGraph (Number seed=0)
 Constructor with seed. More...
 
 CliqueGraph (lemon::Random &r)
 Constructor with custom random number generator. More...
 
double p ()
 
virtual Graphinit (int s, int c, double p)
 Initialise the generator. More...
 
virtual void generate ()
 Generate graph.
 
- Public Member Functions inherited from minlca::utils::RandomGraph< CliqueSet< BaseGraph > >
 RandomGraph (Number seed=0)
 Constructor with seed. More...
 
 RandomGraph (lemon::Random &r)
 Constructor with custom random number generator. More...
 
 ~RandomGraph ()
 Destructor. More...
 
void seed (Number seed)
 Change the random number generator seed. More...
 
void changeRandom (lemon::Random &r)
 Change the random number generator. More...
 
- Public Member Functions inherited from minlca::utils::CliqueSet< BaseGraph >
virtual Graphinit (int s, int c)
 Initialise the generator. More...
 
int cliqueOrder () const
 Retrieve the order of each clique. More...
 
int cliques () const
 Retrieve the number of cliques. More...
 

Protected Types

typedef CliqueGraph< BaseGraph > Graph
 
typedef RandomGraph< CliqueSet< BaseGraph > > Base
 
- Protected Types inherited from minlca::utils::CliqueSet< BaseGraph >
typedef CliqueSet< BaseGraph > Graph
 

Protected Attributes

double _p
 Probability of edge between cliques.
 
- Protected Attributes inherited from minlca::utils::RandomGraph< CliqueSet< BaseGraph > >
lemon::Random * _r
 Random number generator.
 
bool _delete_random
 Delete the random number generator in destructor.
 
- 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::CliqueGraph< BaseGraph >

Class describing a random graph with cliques.

Read the report of Bachelor's Thesis Algorithms for the linear colouring arrangement problem for more information.

Definition at line 107 of file cliques.hh.

Constructor & Destructor Documentation

template<typename BaseGraph = lemon::SmartGraph>
template<typename Number = int>
minlca::utils::CliqueGraph< BaseGraph >::CliqueGraph ( Number  seed = 0)
inline

Constructor with seed.

See also
RandomGraph::RandomGraph(Number)

Definition at line 121 of file cliques.hh.

template<typename BaseGraph = lemon::SmartGraph>
minlca::utils::CliqueGraph< BaseGraph >::CliqueGraph ( lemon::Random &  r)
inline

Constructor with custom random number generator.

See also
RandomGraph::RandomGraph(lemon::Random &)

Definition at line 128 of file cliques.hh.

Member Function Documentation

template<typename BaseGraph = lemon::SmartGraph>
virtual Graph& minlca::utils::CliqueGraph< BaseGraph >::init ( int  s,
int  c,
double  p 
)
inlinevirtual

Initialise the generator.

See also
CliqueSet::init(int,int)
Parameters
pProbability of edge between cliques

Definition at line 140 of file cliques.hh.


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