The symbolic constraint for matchings.
#include <matching.h>
Public Member Functions | |
MATCHING (Graph &G_, map< vertex_descriptor, int > &NC_, var_map< edge_descriptor > &VM_, bool perfect_=true) | |
Constructor. | |
~MATCHING () | |
Destructor. | |
void | init (subproblem &S) |
Adds the capacity equality constraints. | |
status | standard_separation (subproblem &S) |
status | fast_separation (subproblem &S) |
status | feasible (solution &S) |
void | info () |
Definition at line 23 of file matching.h.
MATCHING::MATCHING | ( | Graph & | G_, | |
map< vertex_descriptor, int > & | NC_, | |||
var_map< edge_descriptor > & | VM_, | |||
bool | perfect_ = true | |||
) | [inline] |
Ensures that the edges in X form a matching
Preconditions:
true|false
Definition at line 17 of file matching.cc.
MATCHING< Graph >::status MATCHING::fast_separation | ( | subproblem & | S | ) | [inline, virtual] |
The fast separation function using only a heuristic
Reimplemented from SCIL::sym_constraint.
Definition at line 394 of file matching.cc.
References SCIL::subproblem::configuration().
MATCHING< Graph >::status MATCHING::feasible | ( | solution & | S | ) | [inline, virtual] |
Returns true if the induced graph is a matching.
Reimplemented from SCIL::sym_constraint.
Definition at line 258 of file matching.cc.
References SCIL::subproblem::configuration().
void MATCHING::info | ( | ) | [inline, virtual] |
Returns information on the symbolic constraints.
Reimplemented from SCIL::sym_constraint.
Definition at line 406 of file matching.cc.
MATCHING< Graph >::status MATCHING::standard_separation | ( | subproblem & | S | ) | [inline, virtual] |
The main separation function
Reimplemented from SCIL::sym_constraint.
Definition at line 381 of file matching.cc.
References SCIL::subproblem::configuration().