/*Breadth-First Search*/

#pragma once
#include <queue>
#include "MazeGenerator.h"
#include "PathGenerator.h"
class BFS : public PathGenerator
{
public:
	void MazeSearch(char** maze, int rows, int cols, PathGenerator::Location startpoint, int rowExit, int colExit);
private:
	static constexpr uint32_t Maze_Char_Space = PathGenerator::Maze_Char_Space; // " " 
	static constexpr uint32_t Maze_Char_Wall = PathGenerator::Maze_Char_Wall; // X 
	static constexpr uint32_t Maze_Char_Path = PathGenerator::Maze_Char_Path; // o 

	static constexpr uint32_t Maze_Char_Exit = PathGenerator::Maze_Char_Exit; // E
	static constexpr uint32_t Maze_Char_Start = PathGenerator::Maze_Char_Start; // S

	int rowNum[4] = { -1,0,0,1 };
	int colNum[4] = { 0,-1,1,0 };
};