#include <iostream>
#include <time.h>
#include <stdlib.h>
#include <conio.h>

using namespace std;

class Thing{
        public:
        Thing(string name,int value){
                this->name=name;
                this->value=value;
        }
        string name;
        int value;
};

class Node{
        public:
        Thing *item;
        Node(){
                this->item=NULL;
        }
        ~Node(){
                if(this->item)
                        delete this->item;
        }
};

class Graph{
        public:
        Node ***nodes;
        int x;
        int y;
        int width;
        int height;
        Graph(int width,int height,string *def){
                this->x=0;
                this->y=0;
                this->width=width;
                this->height=height;
                nodes=new Node **[height];
                for(int i=0;i<height;i++)
                        for(int j=0;j<width;j++)
                                if(def[i][j]=='X')
                                        nodes[i][j]=new Node();
                                else
                                        nodes[i][j]=NULL;
        }
        void up(){
                if(this->x>0)
                        this->x--;
                else
                        cout<<"\nCannot move up.";
                return;
        }
        void down(){
                if(this->x<this->height-1)
                        this->x++;
                else
                        cout<<"\nCannot move down.";
                return;
        }
        void left(){
                if(this->y>0)
                        this->y--;
                else
                        cout<<"\nCannot move left.";
                return;
        }
        void right(){
                if(this->y<this->width-1)
                        this->y++;
                else
                        cout<<"\nCannot move right.";
                return;
        }
        ~Graph(){
                for(int i=0;i<height;i++)
                        for(int j=0;j<width;j++)
                                if(this->nodes[i][j])
                                        delete this->nodes[i][j];
        }
};

int main(){
        srand(time(0));



        getche();
        return 0;
}