Matrix.cpp

//
// Created by tomer on 1/13/19.
//

#include "Matrix.h"

Matrix::Matrix(int **matrix, int row, int col, Node *start, Node *goal) {
    this->matrix=matrix;
    this->row=row;
    this->col=col;
    this->start=start;
    this->goal=goal;
}

Matrix::Matrix(int **matrix, int row, int col, int i_start, int j_start, int i_goal, int j_goal) {
    this->matrix=matrix;
    this->row=row;
    this->col=col;
    start= new Node(i_start,j_start);
    goal= new Node(i_goal,j_goal);
}

Matrix::Matrix(int **matrix, int row, int col) {
    this->matrix=matrix;
    this->row=row;
    this->col=col;
    start = new Node(0,0);
    goal = new Node (row-1,col-1);
}

State<Node> *Matrix::stateGenarator(int i, int j, State<Node> *pre) {
    //first of all we check if there is an edge
    if(matrix[i][j]==-1){
        return nullptr;
    }
    Node *myNode= new Node(i,j);
    double weight;
    //double pre_weight=0;
    if(pre== nullptr){
        weight= matrix[i][j];
    }
    else{
        weight= pre->getWeight() + matrix[i][j];
    }
    State<Node>* ans= new State<Node>(myNode,weight,pre);
    return ans;
}

Matrix::~Matrix() {
    delete (start);
    delete (goal);
}

State<Node> *Matrix::getInitialState() {
    return stateGenarator(start->i,start->j, nullptr);
}

set<State<Node> *> Matrix::getAllPossibleStates(State<Node>* currState) {
    //current state
    Node *location= currState->getState();
    int i= location->i;
    int j= location->j;
    //node that will be inserted to set
    State<Node>* insert_toSet;
    //this is the set that will be returned with all possible states
    set<State<Node>*> toReturn;
    if(i!=row-1){
        insert_toSet = stateGenarator(i+1,j,currState);
        if(insert_toSet != nullptr)
            toReturn.insert(insert_toSet);
    }
    if(j!=col-1){
        insert_toSet = stateGenarator(i, j+1, currState);
        if(insert_toSet != nullptr)
            toReturn.insert(insert_toSet);
    }
    if(i!=0){
        insert_toSet = stateGenarator(i-1, j, currState);
        if(insert_toSet != nullptr)
            toReturn.insert(insert_toSet);
    }
    if(j!=0){
        insert_toSet=(i,j-1,currState);
        if(insert_toSet != nullptr)
            toReturn.insert(insert_toSet);
    }
    return toReturn;
}

bool Matrix::isGoal(State<Node>* currState) {
    bool ans= false;
    //get current state
    Node *location= currState->getState();
    if(*location == *goal)
        ans=true;
    return ans;
}

string Matrix::getStrRepresentation() {
    string rep;
    for (int i = 0; i < this->row; i++) {
        for (int j = 0; j < this->col; j++) {
            rep += this->matrix[i][j];
            rep += " ";
            rep += ",";
        }
        rep += "\n";
    }
    rep += "\n";
    rep += to_string(this->start->i) += to_string(this->start->j) += "\n";
    rep += to_string(this->goal->i) += to_string(this->goal->j) += "\n";
    return rep;
}

/*
Matrix::Matrix(int **matrix, int row, int col, Node *start, Node *goal) {
    this->matrix=matrix;
    this->row=row;
    this->col=col;
    this->start=start;
    this->goal=goal;
}

Matrix::Matrix(int **matrix, int row, int col, int i_start, int j_start, int i_goal, int j_goal) {
    this->matrix=matrix;
    this->row=row;
    this->col=col;
    start= new Node(i_start,j_start);
    goal= new Node(i_goal,j_goal);
}

Matrix::Matrix(int **matrix, int row, int col) {
    this->matrix=matrix;
    this->row=row;
    this->col=col;
    start = new Node(0,0);
    goal = new Node (row-1,col-1);
}

State<Node> *Matrix::stateGenarator(int i, int j, State<Node> *pre) {
    //first of all we check if there is an edge
    if(matrix[i][j]==-1){
        return nullptr;
    }
    Node *myNode= new Node(i,j);
    double weight;
    //double pre_weight=0;
    if(pre== nullptr){
        weight= matrix[i][j];
    }
    else{
         weight= pre->getWeight() + matrix[i][j];
    }
    State<Node>* ans= new State<Node>(myNode,weight,pre);
    return ans;
}

Matrix::~Matrix() {
    delete (start);
    delete (goal);
}

State<Node> *Matrix::getInitialState() {
    return stateGenarator(start->i,start->j, nullptr);
}

set<State<Node> *> Matrix::getAllPossibleStates(State<Node>* currState) {
    //current state
    Node *location= currState->getState();
    int i= location->i;
    int j= location->j;
    //node that will be inserted to set
    State<Node>* insert_toSet;
    //this is the set that will be returned with all possible states
    set<State<Node>*> toReturn;
    if(i!=row-1){
        insert_toSet = stateGenarator(i+1,j,currState);
        if(insert_toSet != nullptr)
            toReturn.insert(insert_toSet);
    }
    if(j!=col-1){
        insert_toSet = stateGenarator(i, j+1, currState);
        if(insert_toSet != nullptr)
            toReturn.insert(insert_toSet);
    }
    if(i!=0){
        insert_toSet = stateGenarator(i-1, j, currState);
        if(insert_toSet != nullptr)
            toReturn.insert(insert_toSet);
    }
    if(j!=0){
        insert_toSet=(i,j-1,currState);
        if(insert_toSet != nullptr)
            toReturn.insert(insert_toSet);
    }
    return toReturn;







}

bool Matrix::isGoal(State<Node>* currState) {
    bool ans= false;
    //get current state
    Node *location= currState->getState();
    if(*location == *goal)
        ans=true;
    return ans;
}
*/