Generated on Sun Feb 17 15:25:27 2019 for Gecode by doxygen 1.6.3

Gecode::Int::NValues::Graph Class Reference

View-value graph for propagation of upper bound. More...

#include <nvalues.hh>

List of all members.

Public Member Functions

 Graph (void)
 Construct graph as not yet initialized.
int size (void) const
 Return size of maximal matching (excluding assigned views).
void init (Space &home, const ValSet &vs, const ViewArray< IntView > &x)
 Initialize graph including values in vs.
void sync (void)
 Synchronize graph with new view domains.
bool mark (void)
ExecStatus prune (Space &home)
 Prune all values corresponding to unused edges.

Protected Attributes

int n_matched
 Number of matched edges.

Detailed Description

View-value graph for propagation of upper bound.

Definition at line 96 of file nvalues.hh.


Constructor & Destructor Documentation

Graph::Graph ( void   )  [inline]

Construct graph as not yet initialized.

Reimplemented from Gecode::Int::ViewValGraph::Graph< IntView >.

Definition at line 37 of file graph.hpp.


Member Function Documentation

int Graph::size ( void   )  const [inline]

Return size of maximal matching (excluding assigned views).

Definition at line 41 of file graph.hpp.

void Graph::init ( Space home,
const ValSet vs,
const ViewArray< IntView > &  x 
) [inline]

Initialize graph including values in vs.

Definition at line 46 of file graph.hpp.

void Graph::sync ( void   )  [inline]

Synchronize graph with new view domains.

Definition at line 90 of file graph.hpp.

bool Graph::mark ( void   )  [inline]

Definition at line 152 of file graph.hpp.

ExecStatus Graph::prune ( Space home  )  [inline]

Prune all values corresponding to unused edges.

Definition at line 255 of file graph.hpp.


Member Data Documentation

Number of matched edges.

Definition at line 99 of file nvalues.hh.


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