Gecode::Int::GCC::VarValGraph< View, Card, isView > Class Template Reference
List of all members.Detailed Description
template<class View, class Card, bool isView>
class Gecode::Int::GCC::VarValGraph< View, Card, isView >
Variable-value-graph used during propagation.
Definition at line 449 of file graphsup.icc.
Constructors and Destructors | |
VarValGraph (ViewArray< View > &, ViewArray< View > &, ViewArray< Card > &, int, int, int) | |
Constructor for the variable-value-graph. | |
~VarValGraph (void) | |
Destructor. | |
Graph-interface | |
bool | failed (void) |
Check whether propagation failed This is actually needed to cope with failures occuring in functions returing only a boolean value and not an ExecStatus. | |
void | failed (bool b) |
Set the failure flag of the graph. | |
bool | min_require (Space *home) |
Check whether minimum requirements shrink variable domains. | |
bool | sync (void) |
Check whether propagation failed This is actually needed to cope with failures occuring in functions returing only a boolean value and not an ExecStatus. | |
void | print_graph (void) |
Print graph information for debugging. | |
template<BC > | |
void | print_matching (void) |
Print matching information for debugging. | |
void | print_match (void) |
Gather matching information. | |
void | print_edges (void) |
Print edge information. | |
void * | operator new (size_t t) |
Allocate memory for the graph. | |
void | operator delete (void *p) |
Free the memory for the graph. | |
template<BC > | |
bool | narrow (Space *) |
Remove all those edges from the graph that do not belong to any possible maximum matching on the graph. | |
template<BC > | |
bool | maximum_matching (void) |
Compute a maximum matching M on the graph. | |
template<BC > | |
void | free_alternating_paths (void) |
Compute possible free alternating paths in the graph. | |
template<BC > | |
void | strongly_connected_components (void) |
Compute possible strongly connected components of the graph. | |
template<BC > | |
bool | augmenting_path (VVGNode *) |
Test whether the current maximal matching on the graph can be augmented by an alternating path starting and ending with a free node. | |
template<BC > | |
void | dfs (VVGNode *, bool[], bool[], int[], Support::StaticStack< VVGNode * > &, Support::StaticStack< VVGNode * > &, int &) |
Perform depth-first search on the graph. |
Constructor & Destructor Documentation
|
Constructor for the variable-value-graph. The variable parition is initialized with the variables from x, the value partition is initialized with the values from v, where val_idx[i] is the index of in . nov denotes the cardinality of the value partition in the graph, noe the number of edges in the graph, min_occ the sum over the minimal occurences of all values and max_occ the sum over the maximal occurences of all values. Definition at line 1251 of file graphsup.icc. |
|
Destructor.
Definition at line 2354 of file graphsup.icc. |
Member Function Documentation
|
Check whether propagation failed This is actually needed to cope with failures occuring in functions returing only a boolean value and not an ExecStatus.
Definition at line 1358 of file graphsup.icc. |
|
Set the failure flag of the graph.
Definition at line 1364 of file graphsup.icc. |
|
Check whether minimum requirements shrink variable domains.
Definition at line 1372 of file graphsup.icc. |
|
Check whether propagation failed This is actually needed to cope with failures occuring in functions returing only a boolean value and not an ExecStatus.
Definition at line 1458 of file graphsup.icc. |
|
Print graph information for debugging.
Definition at line 2297 of file graphsup.icc. |
|
Print matching information for debugging.
Definition at line 2255 of file graphsup.icc. |
|
Gather matching information.
Definition at line 2214 of file graphsup.icc. |
|
Print edge information.
Definition at line 2222 of file graphsup.icc. |
|
Allocate memory for the graph.
Definition at line 2360 of file graphsup.icc. |
|
Free the memory for the graph.
Definition at line 2366 of file graphsup.icc. |
|
Remove all those edges from the graph that do not belong to any possible maximum matching on the graph.
Definition at line 1679 of file graphsup.icc. |
|
Compute a maximum matching M on the graph.
Definition at line 1820 of file graphsup.icc. |
|
Compute possible free alternating paths in the graph.
Definition at line 2002 of file graphsup.icc. |
|
Compute possible strongly connected components of the graph.
Definition at line 2190 of file graphsup.icc. |
|
Test whether the current maximal matching on the graph can be augmented by an alternating path starting and ending with a free node.
Definition at line 1893 of file graphsup.icc. |
|
Perform depth-first search on the graph. Depth first search used to compute the strongly connected components of the graph. Definition at line 2112 of file graphsup.icc. |
The documentation for this class was generated from the following file:
- gecode/int/gcc/graphsup.icc (Revision: 3512)