SMT-RAT
24.02
Toolbox for Strategic and Parallel Satisfiability-Modulo-Theories Solving
|
#include <Node.h>
Public Types | |
enum class | Type { UNDETERMINED , CONFLICT , LEAF , LBS , UBS , NBS , FM } |
using | RowIndex = Matrix::RowIndex |
using | ColIndex = Matrix::ColIndex |
Public Member Functions | |
Node (bool is_sat) | |
Node () | |
Node (const Matrix &m, const std::vector< ColIndex > &cols) | |
Node (const Matrix &m, const std::vector< ColIndex > &cols, const std::set< RowIndex > &ign) | |
Node (Matrix &&m, const std::vector< ColIndex > &cols) | |
bool | is_conflict () const |
bool | is_finished () const |
void | choose_elimination () |
Static Public Member Functions | |
static Node | conflict () |
static Node | leaf () |
Data Fields | |
Matrix | matrix |
Type | type = Type::UNDETERMINED |
ColIndex | chosen_col |
std::vector< ColIndex > | cols_to_elim |
std::vector< RowIndex > | eliminators |
std::set< RowIndex > | ignored |
|
strong |
|
inline |
|
inline |
|
inline |
|
inlinestatic |
|
inlinestatic |
Type smtrat::fmplex::Node::type = Type::UNDETERMINED |