mapgenerator.cpp

/* 
Copyright (C) 2016 Meritxell Jordana
Copyright (C) 2016 Marc Sanchez
*/

#include "mapgenerator.h"
#include <cstdlib>
#include <ctime>
#include <stack>

using namespace std;

MapGenerator::MapGenerator(const int nRows, const int nCols) :
        map(Map(nRows - ((nRows % 2 == 0) ? 1 : 0),
        nCols / 2 + nCols % 2)), nRows(nRows), nCols(nCols) {
    generate();
}

Map MapGenerator::getMap() {
    Map m = Map(nRows, nCols, Position(1, 1), Position(1, nCols - 2));
    m.copySubMap(map, Position(0, 0));
    m.setSubColCellType(map.getNumberOfCols() - 1,
            1, map.getNumberOfRows() - 1, Food);
    m.copySymmetricLeftToRight();
    m.initGame();
    return m;
}

void MapGenerator::generate() {
    srand(time(NULL));
    set<Position> visited;
    stack<Position> stk;
    Position *current = new Position(1, 1);
    stk.push(*current);
    visited.insert(*current);

    while(!stk.empty()) {
        list<Position> unvisitedNeighbors = map.getUnvisitedNeighbors(*current, visited);
        if (unvisitedNeighbors.empty()) {
            current = new Position(stk.top());
            list<Position> neighbors = map.getNeighbors(*current);
            Position p = map.getRandomPositionOfList(neighbors);
            map.removeWall(*current, p);
            stk.pop();
        } else {
            Position *neighbor = new Position(map.getRandomPositionOfList(unvisitedNeighbors));
            map.removeWall(*current, *neighbor);
            delete(current);
            current = neighbor;
            visited.insert(*current);
            stk.push(*current);
        }
    }
}