Value node. More...
#include <dom-sup.hpp>
Public Attributes | |
int | val |
Stores the value of the node. | |
Public Attributes inherited from Gecode::Int::GCC::Node | |
int | noe |
stores the number of incident edges on the node |
Protected Attributes | |
int | _klb |
Minimal required occurence of the value as stored in k. | |
int | _kub |
Maximal required occurence of the value as stored in k. | |
int | _kidx |
Index to acces the value via cardinality array k. | |
int | _kcount |
Stores the current number of occurences of the value. | |
int | noc |
Store numbre of conflicting matching edges. | |
int | lb |
Minimal capacity of the value node. | |
int | ublow |
Smallest maximal capacity of the value node. | |
int | ub |
Maximal capacity of the value node. | |
Protected Attributes inherited from Gecode::Int::GCC::Node | |
Edge * | e |
Stores all incident edges on the node. | |
Edge * | fst |
First edge. | |
Edge * | lst |
Last edge. | |
Edge * | ie |
Single incoming edge used for storing a path in the algorithms. | |
int | idx |
Index. | |
unsigned char | nf |
Flags for node. |
Constructors and destructors | |
ValNode (void) | |
Default constructor. | |
ValNode (int min, int max, int value, int kidx, int kshift, int count) | |
Constructor for value node. |
Access | |
int | maxlow (void) const |
get max cap for LBC | |
void | card_conflict (int c) |
Mark the value node as conflicting in case of variable cardinalities. | |
int | card_conflict (void) const |
Check whether the value node is conflicting. | |
void | red_conflict (void) |
Reduce the conflict counter. | |
void | inc (void) |
increases the value counter | |
int | kcount (void) const |
returns the current number of occurences of the value | |
int | incid_match (BC bc) const |
returns the number of incident matching edges on a value node | |
int | kindex (void) const |
returns the index in cardinality array k | |
bool | matched (BC bc) const |
returns true if the node is matched in BC, false otherwise | |
bool | sink (void) const |
tests whether the node is a sink | |
bool | source (void) const |
tests whether the node is a source | |
int | kmin (void) const |
return the minimal node capacity as stored in k | |
int | kmax (void) const |
return the maximal node capacity as stored in k | |
int | kbound (BC bc) const |
return minimal or maximal capacity |
Update | |
void | maxlow (int i) |
set the max cap for LBC | |
void | kcount (int) |
Set how often value occurs. | |
void | kindex (int) |
changes the index in the cardinality array k | |
void | dec (BC bc) |
decrease the node-capacity | |
void | inc (BC bc) |
increase the node-capacity | |
int | cap (BC bc) const |
return the the node-capacity | |
void | cap (BC bc, int c) |
set the node-capacity to c | |
void | match (BC bc) |
match the node | |
void | unmatch (BC bc) |
unmatch the node | |
void | reset (void) |
node reset to original capacity values | |
void | kmin (int min) |
set the minimal k-capacity to min | |
void | kmax (int max) |
set the maximal k-capacity to max |
Additional Inherited Members | |
Node (void) | |
Default constructor. | |
Node (NodeFlag nf, int i) | |
Constructor for index i that sets type to t. | |
bool | type (void) const |
Return the type of the node (false for a variable node) | |
Edge ** | adj (void) |
Return reference to the incident edges. | |
Edge * | first (void) const |
Return pointer to the first incident edge. | |
Edge * | last (void) const |
Return pointer to the last incident edge. | |
Edge * | inedge (void) const |
Return pointer to the node's inedge. | |
int | index (void) const |
Get index of either variable or value. | |
bool | removed (void) const |
check whether a node has been removed from the graph | |
void | first (Edge *p) |
Set the first edge pointer to p. | |
void | last (Edge *p) |
Set the last edge pointer to p. | |
void | inedge (Edge *p) |
Set the inedge pointer to p. | |
void | index (int i) |
Set index of either variable or value. | |
static void * | operator new (size_t s, Space &home) |
Allocate memory from space. | |
static void | operator delete (void *, Space &) |
Free memory (unused) | |
static void | operator delete (void *) |
Needed for exceptions. | |
Protected Types inherited from Gecode::Int::GCC::Node | |
enum | NodeFlag { NF_NONE = 0 , NF_VAL = 1 << 0 , NF_M_LBC = 1 << 1 , NF_M_UBC = 1 << 2 } |
Flags for nodes. More... |
Value node.
Definition at line 166 of file dom-sup.hpp.
|
inline |
Default constructor.
Definition at line 625 of file dom-sup.hpp.
|
inline |
Constructor for value node.
with minimal capacity min, maximal capacity max, the value value and the index k_access in k
Definition at line 628 of file dom-sup.hpp.
|
inline |
get max cap for LBC
Definition at line 642 of file dom-sup.hpp.
|
inline |
Mark the value node as conflicting in case of variable cardinalities.
Definition at line 651 of file dom-sup.hpp.
|
inline |
Check whether the value node is conflicting.
Definition at line 662 of file dom-sup.hpp.
|
inline |
Reduce the conflict counter.
Definition at line 656 of file dom-sup.hpp.
|
inline |
increases the value counter
Definition at line 753 of file dom-sup.hpp.
|
inline |
returns the current number of occurences of the value
Definition at line 758 of file dom-sup.hpp.
|
inline |
returns the number of incident matching edges on a value node
Returs the number of incident matching edges on the node.
Definition at line 779 of file dom-sup.hpp.
|
inline |
returns the index in cardinality array k
Definition at line 773 of file dom-sup.hpp.
|
inline |
returns true if the node is matched in BC, false otherwise
Definition at line 674 of file dom-sup.hpp.
|
inline |
tests whether the node is a sink
Definition at line 788 of file dom-sup.hpp.
|
inline |
tests whether the node is a source
Definition at line 795 of file dom-sup.hpp.
|
inline |
return the minimal node capacity as stored in k
Definition at line 701 of file dom-sup.hpp.
|
inline |
return the maximal node capacity as stored in k
Definition at line 696 of file dom-sup.hpp.
|
inline |
return minimal or maximal capacity
Definition at line 687 of file dom-sup.hpp.
|
inline |
set the max cap for LBC
Definition at line 636 of file dom-sup.hpp.
|
inline |
Set how often value occurs.
Definition at line 763 of file dom-sup.hpp.
|
inline |
changes the index in the cardinality array k
Definition at line 768 of file dom-sup.hpp.
|
inline |
decrease the node-capacity
Definition at line 717 of file dom-sup.hpp.
|
inline |
increase the node-capacity
Definition at line 726 of file dom-sup.hpp.
|
inline |
return the the node-capacity
Definition at line 667 of file dom-sup.hpp.
|
inline |
set the node-capacity to c
Definition at line 745 of file dom-sup.hpp.
|
inline |
match the node
Definition at line 735 of file dom-sup.hpp.
|
inline |
unmatch the node
Definition at line 740 of file dom-sup.hpp.
|
inline |
node reset to original capacity values
Definition at line 679 of file dom-sup.hpp.
|
inline |
set the minimal k-capacity to min
Definition at line 706 of file dom-sup.hpp.
|
inline |
set the maximal k-capacity to max
Definition at line 711 of file dom-sup.hpp.
|
protected |
Minimal required occurence of the value as stored in k.
Definition at line 169 of file dom-sup.hpp.
|
protected |
Maximal required occurence of the value as stored in k.
Definition at line 171 of file dom-sup.hpp.
|
protected |
Index to acces the value via cardinality array k.
Definition at line 173 of file dom-sup.hpp.
|
protected |
Stores the current number of occurences of the value.
Definition at line 175 of file dom-sup.hpp.
|
protected |
Store numbre of conflicting matching edges.
Definition at line 177 of file dom-sup.hpp.
|
protected |
Minimal capacity of the value node.
Definition at line 179 of file dom-sup.hpp.
|
protected |
Smallest maximal capacity of the value node.
Definition at line 181 of file dom-sup.hpp.
|
protected |
Maximal capacity of the value node.
Definition at line 183 of file dom-sup.hpp.
int Gecode::Int::GCC::ValNode::val |
Stores the value of the node.
Definition at line 186 of file dom-sup.hpp.