// Created by Ali_combination #include #include using namespace std; typedef vector> vector_t; class BooleanAlgebra { public: BooleanAlgebra(vector_t&& matrix); BooleanAlgebra(const vector_t& matrix); BooleanAlgebra(int); BooleanAlgebra(); BooleanAlgebra operator * (const BooleanAlgebra&); BooleanAlgebra operator | (const BooleanAlgebra&); BooleanAlgebra operator & (const BooleanAlgebra&); BooleanAlgebra operator ^ (const BooleanAlgebra&); void display(); private: vector_t matrix; int ROWS_CNT; int COLS_CNT; int power; }; int main() { vector_t matrix_1 { {0, 0, 1, 0, 1}, {1, 0, 0, 0, 0}, {0, 1, 0, 0, 0}, {1, 0, 0, 0, 0}, {0, 0, 1, 1, 0} }; vector_t matrix_2 { {0, 0, 1, 0, 1}, {1, 0, 0, 0, 0}, {0, 1, 0, 0, 0}, {1, 0, 0, 0, 0}, {0, 0, 1, 1, 0} }; BooleanAlgebra instance_1(matrix_1); BooleanAlgebra instance_2(2); BooleanAlgebra result; result = instance_1 ^ instance_2; result.display(); return 0; } BooleanAlgebra::BooleanAlgebra(vector_t&& matrix) :matrix(std::move(matrix)), ROWS_CNT(matrix.size()), COLS_CNT(matrix[0].size()) { } BooleanAlgebra::BooleanAlgebra(const vector_t& matrix) : matrix(matrix), ROWS_CNT(matrix.size()), COLS_CNT(matrix[0].size()) { } BooleanAlgebra::BooleanAlgebra(int power) :power(power) { } BooleanAlgebra::BooleanAlgebra() { } BooleanAlgebra BooleanAlgebra::operator * (const BooleanAlgebra& other) { BooleanAlgebra eval; eval.matrix.resize(ROWS_CNT); for (int i = 0; i < ROWS_CNT; i++) { eval.matrix[i].resize(COLS_CNT); for (int j = 0; j < other.COLS_CNT; j++) { bool is_found = false; for (int k = 0; k < COLS_CNT; k++) { if (this->matrix[i][k] == 1 && other.matrix[k][j] == 1) { eval.matrix[i][j] = 1; is_found = true; break; } } if (is_found == false) eval.matrix[i][j] = 0; } } return eval; } BooleanAlgebra BooleanAlgebra::operator | (const BooleanAlgebra& other) { BooleanAlgebra eval; eval.matrix.resize(ROWS_CNT); for (int i = 0; i < ROWS_CNT; i++) { eval.matrix[i].resize(COLS_CNT); for (int j = 0; j < COLS_CNT; j++) { if (this->matrix[i][j] == 1 || other.matrix[i][j] == 1) eval.matrix[i][j] = 1; else eval.matrix[i][j] = 0; } } return eval; } BooleanAlgebra BooleanAlgebra::operator & (const BooleanAlgebra& other) { BooleanAlgebra eval; eval.matrix.resize(ROWS_CNT); for (int i = 0; i < ROWS_CNT; i++) { eval.matrix[i].resize(COLS_CNT); for (int j = 0; j < COLS_CNT; j++) { if (this->matrix[i][j] == 1 && other.matrix[i][j] == 1) eval.matrix[i][j] = 1; else eval.matrix[i][j] = 0; } } return eval; } BooleanAlgebra BooleanAlgebra::operator ^ (const BooleanAlgebra& other) { BooleanAlgebra eval; eval.matrix = this->matrix; vector_t temp = this->matrix; for (int range = 1; range < other.power; range++) { for (int i = 0; i < ROWS_CNT; i++) { for (int j = 0; j < COLS_CNT; j++) { bool is_found = false; for (int k = 0; k < COLS_CNT; k++) { if (eval.matrix[i][k] == 1 && this->matrix[k][j] == 1) { temp[i][j] = 1; is_found = true; break; } } if (is_found == false) temp[i][j] = 0; } } eval.matrix = temp; } return eval; } void BooleanAlgebra::display() { vector_t::iterator row; vector::iterator col; for (row = matrix.begin(); row != matrix.end(); row++) { for (col = row->begin(); col != row->end(); col++) { cout << *col << ' '; } cout << '\n'; } return; }

[Q&A]: #2