h3MazeGenerator.h

Go to the documentation of this file.

 
#pragma once
 
#include <random>
 
class H3MazeGenerator final : public QObject {
    Q_OBJECT
 
public:
    explicit H3MazeGenerator(QObject *parent = nullptr);
 
    ~H3MazeGenerator() override = default;
 
    struct H3IndexHash {
        std::size_t operator()(const H3Index &index) const { return std::hash<uint64_t>()(index); }
    };
 
    struct MazeResult {
        std::unordered_set<H3Index> walls;  
        H3Index entrance;                   
        H3Index exit;                       
    };
 
    std::unordered_set<H3Index> generateMaze(H3Index centerCell, int radius);
 
    MazeResult generateMazeWithEntrances(H3Index centerCell, int radius);
 
signals:
    void generationProgress(int percent);
 
    void mazeGenerated(const std::unordered_set<H3Index> &walls);
 
private:
    std::mt19937 rng_;
 
    std::array<H3Index, 6> neighbors_{};
 
    std::array<H3Index, 6> getNeighbors(H3Index cell);
 
    static std::unordered_set<H3Index, H3IndexHash> getCellsInRadius(H3Index center, int radius);
 
    std::unordered_set<H3Index, H3IndexHash> createRoomGrid(const std::unordered_set<H3Index, H3IndexHash> &allCells);
 
    std::optional<H3Index> findWallBetween(H3Index room1, H3Index room2);
 
    std::unordered_set<H3Index, H3IndexHash> generateMazePrim(const std::unordered_set<H3Index, H3IndexHash> &rooms);
 
    static std::vector<H3Index> getRoomNeighbors(H3Index room, const std::unordered_set<H3Index, H3IndexHash> &rooms);
 
    H3Index findFarthestRoom(H3Index start, const std::unordered_set<H3Index, H3IndexHash> &passages);
 
    static bool isOnBorder(H3Index cell, H3Index center, int radius);
};