/*____________________________________________________________________________
pathfinding in a labyrinth
par Martin Robinson
inherited from pathfinding
Structure de donnée, tp3 find path through a labyrinth

______________________________________________________________________________
preprocesseur
____________________________________________________________________________*/

#pragma once
#ifndef _LABY
#define _LABY

#include "path.hpp"

/*____________________________________________________________________________
class
____________________________________________________________________________*/

class labyrinth : public pathfind{
    const char * _map;                          //map containing labyrinth
    int _w,                                     //width of the labyrinth
        _h;                                     //height of the labyrinth
protected:
    stack<node> * getAllNeighbor(int from);     //overload for specialisation
public:
    labyrinth(const char * , int w, int h);     //constructor
};

#endif