/*____________________________________________________________________________
pathfinding in a graph
par Martin Robinson
inherited from pathfinding
Introduction réseau , tp3 finding route accross network

______________________________________________________________________________
preprocesseur
____________________________________________________________________________*/

#pragma once
#ifndef _GRAPH
#define _GRAPH

#include "path.hpp"

/*____________________________________________________________________________
struct
____________________________________________________________________________*/

struct graph{
    char from,                                  //first node
         to;                                    //second node
    int cost;                                   //cost between
};

/*____________________________________________________________________________
class
____________________________________________________________________________*/

class graphfind : public pathfind{
    const graph * _map;                         //the entire map
    int _mapSize;                               //number of link
protected:
    stack<node> * getAllNeighbor(int from);     //overload for specialisation
public:
    graphfind(const graph * map, int size);     //constructor
};


#endif