Generated on Tue May 22 09:40:48 2018 for Gecode by doxygen 1.6.3

LangfordNumber Class Reference
[Example scripts (models)]

Example: Langford's number problem More...

List of all members.

Public Types


Propagation to use for model.


Public Member Functions

 LangfordNumber (const LangfordNumberOptions &opt)
 Construct model.
virtual void print (std::ostream &os) const
 Print solution.
 LangfordNumber (LangfordNumber &l)
 Constructor for cloning l.
virtual Spacecopy (void)
 Copy during cloning.

Protected Attributes

int k
int n
 Problem parameters.
IntVarArray y
 Sequence variables.

Detailed Description

Example: Langford's number problem

See problem 24 at

Definition at line 80 of file langford-number.cpp.

Member Enumeration Documentation

anonymous enum

Propagation to use for model.


Use reified constraints.


Use extensional constraints.


Use extensional and channel constraints.

Definition at line 87 of file langford-number.cpp.

Constructor & Destructor Documentation

LangfordNumber::LangfordNumber ( const LangfordNumberOptions opt  )  [inline]

Construct model.

Definition at line 93 of file langford-number.cpp.

LangfordNumber::LangfordNumber ( LangfordNumber l  )  [inline]

Constructor for cloning l.

Definition at line 173 of file langford-number.cpp.

Member Function Documentation

virtual void LangfordNumber::print ( std::ostream &  os  )  const [inline, virtual]

Print solution.

Reimplemented from Gecode::Driver::ScriptBase< BaseSpace >.

Definition at line 168 of file langford-number.cpp.

virtual Space* LangfordNumber::copy ( void   )  [inline, virtual]

Copy during cloning.

Definition at line 180 of file langford-number.cpp.

Member Data Documentation

int LangfordNumber::k [protected]

Definition at line 82 of file langford-number.cpp.

int LangfordNumber::n [protected]

Problem parameters.

Definition at line 82 of file langford-number.cpp.

Sequence variables.

Definition at line 83 of file langford-number.cpp.

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