maze.h

Go to the documentation of this file.

#ifndef MAZE_H
#define MAZE_H

#include "screenBuffer.h"
#include <map>
#include <memory>

enum NodeType {
    NONE, 
    Path, 
    Wall, 
};

enum Direction {
    NORTH, 
    SOUTH, 
    EAST, 
    WEST, 
};

struct MazeNode {
    NodeType type; 
    std::map<Direction, MazeNode*> neighbors; 
    MazeNode() : type(NodeType::NONE){}

    void addNeighbor(MazeNode* node, Direction direction) {
        if (neighbors.find(direction) != neighbors.end()) {
            throw std::runtime_error("Neighbor already exists in the given direction.");
        }

        neighbors[direction] = node;
    }

    bool removeNeighbor(Direction direction) {
        if (neighbors.find(direction) == neighbors.end()) {
            throw std::runtime_error("Neighbor not found in the given direction.");
        }

        neighbors.erase(direction);
    }

    MazeNode* getNeighbor(Direction direction) const {
        auto neighbor = neighbors.find(direction);
        return (neighbor != neighbors.end()) ? neighbor->second : nullptr;
    }

    std::map<Direction, MazeNode*> getNeighbors() const {
        return neighbors;
    }


    NodeType getNodeType() const {
        return type;
    }

    bool setNodeType(NodeType type) {
        this->type = type;
        return true;
    }
};

class Maze {
 private:
     int WIDTH; 
     int HEIGHT; 
     std::map<std::pair<int, int>, MazeNode*> mazeMape;

     void generateMaze(int width, int height);

public :
    
    Maze();

    Maze(int width, int height);
     

};
 

#endif // MAZE_H