Node in the search tree for LDS
More...
#include <lds.hh>
Node in the search tree for LDS
Definition at line 51 of file lds.hh.
◆ Node() [1/2]
Gecode::Search::Sequential::Probe::Node::Node |
( |
void |
| ) |
|
|
inline |
Default constructor.
Definition at line 135 of file lds.hh.
◆ Node() [2/2]
Gecode::Search::Sequential::Probe::Node::Node |
( |
Space * |
s, |
|
|
const Choice * |
c, |
|
|
unsigned int |
a |
|
) |
| |
|
inline |
Initialize with node s, choice c, and alternative a.
Definition at line 138 of file lds.hh.
◆ space()
Space * Gecode::Search::Sequential::Probe::Node::space |
( |
void |
| ) |
const |
|
inline |
Return space.
Definition at line 142 of file lds.hh.
◆ choice()
const Choice * Gecode::Search::Sequential::Probe::Node::choice |
( |
void |
| ) |
const |
|
inline |
Return choice.
Definition at line 147 of file lds.hh.
◆ alt()
unsigned int Gecode::Search::Sequential::Probe::Node::alt |
( |
void |
| ) |
const |
|
inline |
Return next alternative.
Definition at line 152 of file lds.hh.
◆ next()
void Gecode::Search::Sequential::Probe::Node::next |
( |
void |
| ) |
|
|
inline |
Set next alternative
Definition at line 157 of file lds.hh.
The documentation for this class was generated from the following file: