View-value graph for propagation of upper bound.
More...
#include <nvalues.hh>
|
| 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.
|
|
| Graph (void) |
| Construct graph as not yet initialized.
|
|
| operator bool (void) const |
| Test whether graph has been initialized.
|
|
void | purge (void) |
| Purge graph if necessary (reset information to avoid overflow)
|
|
View-value graph for propagation of upper bound.
Definition at line 96 of file nvalues.hh.
◆ Graph()
Construct graph as not yet initialized.
Definition at line 37 of file graph.hpp.
◆ size()
int Graph::size |
( |
void | | ) |
const |
|
inline |
Return size of maximal matching (excluding assigned views)
Definition at line 41 of file graph.hpp.
◆ init()
Initialize graph including values in vs.
Definition at line 46 of file graph.hpp.
◆ sync()
void Graph::sync |
( |
void | | ) |
|
|
inline |
Synchronize graph with new view domains.
Definition at line 90 of file graph.hpp.
◆ mark()
bool Graph::mark |
( |
void | | ) |
|
|
inline |
◆ prune()
Prune all values corresponding to unused edges.
Definition at line 255 of file graph.hpp.
◆ n_matched
int Gecode::Int::NValues::Graph::n_matched |
|
protected |
Number of matched edges.
Definition at line 99 of file nvalues.hh.
The documentation for this class was generated from the following files: