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

Class defining random geometric graphs. More...

#include <outerplanar.hh>

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

Public Member Functions

 TEMPLATE_GRAPH_TYPEDEFS (Graph)
 
template<typename Number = int>
 RandomOuterplanar (Number seed=0)
 Constructor with seed. More...
 
 RandomOuterplanar (lemon::Random &r)
 Constructor with custom random number generator. More...
 
Graphinit (int n)
 Initialise the generator. More...
 
virtual void generate ()
 Generate graph.
 
int sideA () const
 Retrieve number of vertices on side A More...
 
- Public Member Functions inherited from minlca::utils::RandomGraph< 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...
 

Protected Types

typedef RandomOuterplanar< BaseGraph > Graph
 
typedef RandomGraph< BaseGraph > Base
 

Protected Member Functions

void _crossingChords (int l1, int r1, int l2, int r2)
 Add chrossing chords.
 
void _bridges (int l, int r)
 Add bridges.
 

Protected Attributes

int _n
 Number of vertices.
 
int _side_a
 Number of vertices on side A
 
- Protected Attributes inherited from minlca::utils::RandomGraph< BaseGraph >
lemon::Random * _r
 Random number generator.
 
bool _delete_random
 Delete the random number generator in destructor.
 

Detailed Description

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

Class defining random geometric graphs.

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

Definition at line 22 of file outerplanar.hh.

Constructor & Destructor Documentation

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

Constructor with seed.

See also
RandomGraph::RandomGraph(Number)

Definition at line 40 of file outerplanar.hh.

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

Constructor with custom random number generator.

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

Definition at line 47 of file outerplanar.hh.

Member Function Documentation

template<typename BaseGraph = lemon::SmartGraph>
Graph& minlca::utils::RandomOuterplanar< BaseGraph >::init ( int  n)
inline

Initialise the generator.

Parameters
nNumber of vertices

Definition at line 53 of file outerplanar.hh.

template<typename BaseGraph = lemon::SmartGraph>
int minlca::utils::RandomOuterplanar< BaseGraph >::sideA ( ) const
inline

Retrieve number of vertices on side A

Returns
The number of vertices on side A.

Definition at line 143 of file outerplanar.hh.


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