Gecode::Int::GCC::ValNode Class Reference

Inherits Gecode::Int::GCC::VVGNode.

List of all members.

---

Detailed Description

Value node.

Definition at line 176 of file graphsup.icc.

Constructors and destructors
	ValNode (int min, int max, int value, int kidx, int kshift, int count)
	Constructor for value node.
Access
void	set_maxlow (int i)
	set the max cap for LBC
int	get_maxlow (void)
	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)
	Check whether the value node is conflicting.
void	red_conflict (void)
	Reduce the conflict counter.
bool	removed (void)
	check for removal from graph
void	inc (void)
	increases the value counter
int	kcount (void)
	returns the current number of occurences of the value
template<BC >
int	incid_match (void)
	returns the number of incident matching edges on a value node
int	kindex (void)
	returns the index in cardinality array k
int	get_info (void)
	return the node information
template<BC >
bool	matched (void)
	returns true if the node is matched in BC, false otherwise
bool	sink (void)
	tests whether the node is a sink
bool	source (void)
	tests whether the node is a source
int	kmin (void)
	return the minimal node capacity as stored in k
int	kmax (void)
	return the maximal node capacity as stored in k
template<BC >
int	kbound (void)
	return minimal or maximal capacity
bool	is_matched (BC)
	returns whether the node is still matchable
Update
void	kcount (int)
	changes the index in the cardinality array k
void	kindex (int)
	changes the index in the cardinality array k
template<BC >
void	dec (void)
	decrease the node-capacity
template<BC >
void	inc (void)
	increase the node-capacity
template<BC >
int	cap (void)
	return the the node-capacity
template<BC >
void	set_cap (int c)
	set the node-capacity to c
template<BC >
void	match (void)
	match the node
template<BC >
void	unmatch (void)
	unmatch the node
void	reset (void)
	node reset to original capacity values
void	set_info (int i)
	set the node infomration to i
void	set_kmin (int min)
	set the minimal k-capacity to min
void	set_kmax (int max)
	set the maximal k-capacity to max
Public Attributes
int	val
	stores the value of the node
int	idx
	stores the index of the node
int	noe
	stores the number of incident edges on the node

---

Constructor & Destructor Documentation

Gecode::Int::GCC::ValNode::ValNode	(	int	min,
		int	max,
		int	value,
		int	kidx,
		int	kshift,
		int	count
	)			[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 913 of file graphsup.icc.

---

Member Function Documentation

void Gecode::Int::GCC::ValNode::set_maxlow

(

int

i

)

[inline]

set the max cap for LBC

Value Node.

Definition at line 779 of file graphsup.icc.

int Gecode::Int::GCC::ValNode::get_maxlow

(

void

)

[inline]

get max cap for LBC

Definition at line 785 of file graphsup.icc.

void Gecode::Int::GCC::ValNode::card_conflict

(

int

c

)

[inline]

Mark the value node as conflicting in case of variable cardinalities.

Definition at line 795 of file graphsup.icc.

int Gecode::Int::GCC::ValNode::card_conflict

(

void

)

[inline]

Check whether the value node is conflicting.

Definition at line 806 of file graphsup.icc.

void Gecode::Int::GCC::ValNode::red_conflict

(

void

)

[inline]

Reduce the conflict counter.

Definition at line 800 of file graphsup.icc.

bool Gecode::Int::GCC::ValNode::removed

(

void

)

[inline, virtual]

check for removal from graph

Implements Gecode::Int::GCC::VVGNode.

Definition at line 811 of file graphsup.icc.

void Gecode::Int::GCC::ValNode::inc

(

void

)

[inline]

increases the value counter

Definition at line 885 of file graphsup.icc.

int Gecode::Int::GCC::ValNode::kcount

(

void

)

[inline]

returns the current number of occurences of the value

Definition at line 954 of file graphsup.icc.

template<BC direction>

int Gecode::Int::GCC::ValNode::incid_match

(

void

)

[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 976 of file graphsup.icc.

int Gecode::Int::GCC::ValNode::kindex

(

void

)

[inline]

returns the index in cardinality array k

Definition at line 969 of file graphsup.icc.

int Gecode::Int::GCC::ValNode::get_info

(

void

)

[inline, virtual]

return the node information

Implements Gecode::Int::GCC::VVGNode.

Definition at line 944 of file graphsup.icc.

template<BC direction>

bool Gecode::Int::GCC::ValNode::matched

(

void

)

[inline]

returns true if the node is matched in BC, false otherwise

Definition at line 908 of file graphsup.icc.

bool Gecode::Int::GCC::ValNode::sink

(

void

)

[inline]

tests whether the node is a sink

Definition at line 988 of file graphsup.icc.

bool Gecode::Int::GCC::ValNode::source

(

void

)

[inline]

tests whether the node is a source

Definition at line 997 of file graphsup.icc.

int Gecode::Int::GCC::ValNode::kmin

(

void

)

[inline]

return the minimal node capacity as stored in k

Definition at line 848 of file graphsup.icc.

int Gecode::Int::GCC::ValNode::kmax

(

void

)

[inline]

return the maximal node capacity as stored in k

Definition at line 843 of file graphsup.icc.

template<BC direction>

int Gecode::Int::GCC::ValNode::kbound

(

void

)

[inline]

return minimal or maximal capacity

Definition at line 834 of file graphsup.icc.

bool Gecode::Int::GCC::ValNode::is_matched

(

BC

d

)

[inline, virtual]

returns whether the node is still matchable

Implements Gecode::Int::GCC::VVGNode.

Definition at line 816 of file graphsup.icc.

void Gecode::Int::GCC::ValNode::kcount

(

int

c

)

[inline]

changes the index in the cardinality array k

Definition at line 959 of file graphsup.icc.

void Gecode::Int::GCC::ValNode::kindex

(

int

i

)

[inline]

changes the index in the cardinality array k

Definition at line 964 of file graphsup.icc.

template<BC direction>

void Gecode::Int::GCC::ValNode::dec

(

void

)

[inline]

decrease the node-capacity

Definition at line 874 of file graphsup.icc.

template<BC >

void Gecode::Int::GCC::ValNode::inc

(

void

)

[inline]

increase the node-capacity

template<BC direction>

int Gecode::Int::GCC::ValNode::cap

(

void

)

[inline]

return the the node-capacity

Definition at line 864 of file graphsup.icc.

template<BC direction>

void Gecode::Int::GCC::ValNode::set_cap

(

int

c

)

[inline]

set the node-capacity to c

Definition at line 929 of file graphsup.icc.

template<BC direction>

void Gecode::Int::GCC::ValNode::match

(

void

)

[inline]

match the node

Definition at line 896 of file graphsup.icc.

template<BC direction>

void Gecode::Int::GCC::ValNode::unmatch

(

void

)

[inline]

unmatch the node

Definition at line 902 of file graphsup.icc.

void Gecode::Int::GCC::ValNode::reset

(

void

)

[inline]

node reset to original capacity values

Definition at line 825 of file graphsup.icc.

void Gecode::Int::GCC::ValNode::set_info

(

int

i

)

[inline, virtual]

set the node infomration to i

Implements Gecode::Int::GCC::VVGNode.

Definition at line 939 of file graphsup.icc.

void Gecode::Int::GCC::ValNode::set_kmin

(

int

min

)

[inline]

set the minimal k-capacity to min

Definition at line 853 of file graphsup.icc.

void Gecode::Int::GCC::ValNode::set_kmax

(

int

max

)

[inline]

set the maximal k-capacity to max

Definition at line 858 of file graphsup.icc.

---

Member Data Documentation

int Gecode::Int::GCC::ValNode::val

stores the value of the node

Definition at line 208 of file graphsup.icc.

int Gecode::Int::GCC::ValNode::idx

stores the index of the node

Definition at line 210 of file graphsup.icc.

int Gecode::Int::GCC::ValNode::noe

stores the number of incident edges on the node

Definition at line 212 of file graphsup.icc.

---

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

• gecode/int/gcc/graphsup.icc (Revision: 6323)