View-value graph for propagation of upper bound. More...
#include <nvalues.hh>
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 (Space &home) |
Synchronize graph with new view domains. | |
bool | mark (Space &home) |
ExecStatus | prune (Space &home) |
Prune all values corresponding to unused edges. | |
Protected Attributes | |
int | n_matched |
Number of matched edges. |
View-value graph for propagation of upper bound.
Graph::Graph | ( | void | ) | [inline] |
Construct graph as not yet initialized.
Reimplemented from Gecode::Int::ViewValGraph::Graph< IntView >.
int Graph::size | ( | void | ) | const [inline] |
void Graph::sync | ( | Space & | home | ) | [inline] |
ExecStatus Graph::prune | ( | Space & | home | ) | [inline] |
int Gecode::Int::NValues::Graph::n_matched [protected] |
Number of matched edges.
Definition at line 103 of file nvalues.hh.