Untitled

#include "maze.hpp"
#include "cyclic_double_queue.hpp"
using namespace cs251;

void maze::initialize(const size_t dimX, const size_t dimY, const size_t dimZ, unsigned seed)
{
	//TODO: Remove following line and add your implementation here.
    throw std::logic_error("maze::" + std::string(__FUNCTION__) + " not implemented");
}

bool maze::solve(const size_t startX, const size_t startY, const size_t startZ, const  size_t endX, const size_t endY, const size_t endZ)
{
	//TODO: Remove following line and add your implementation here.
    throw std::logic_error("maze::" + std::string(__FUNCTION__) + " not implemented");
}

std::string maze::print_walls(const size_t z) const
{
	//TODO: Remove following line and add your implementation here.
    throw std::logic_error("maze::" + std::string(__FUNCTION__) + " not implemented");
}

std::string maze::print_marks(const size_t z) const
{
	//TODO: Remove following line and add your implementation here.
    throw std::logic_error("maze::" + std::string(__FUNCTION__) + " not implemented");
}

void maze::get_dim(size_t& dimX, size_t& dimY, size_t& dimZ) const
{
	//TODO: Remove following line and add your implementation here.
    throw std::logic_error("maze::" + std::string(__FUNCTION__) + " not implemented");
}

Direction maze::get_next_direction(unsigned& seed)
{
	//Please do not modify this function! 
	//Any modification of this function may result in a zero for all grading cases.
	std::mt19937 gen(seed);
	seed = gen();
	return static_cast<Direction>(1 << seed % 6);
}

size_t maze::get_index(const size_t x, const size_t y, const size_t z) const
{
	//TODO: Remove following line and add your implementation here.
    throw std::logic_error("maze::" + std::string(__FUNCTION__) + " not implemented");
}