struct node
{
bool available;   //is this node available for pathing
int cost;
int status;       //mailboxed int representing status
int parent_index; //index of parent node in list
};

struct graph
{
    int width, height;
    int unsolved; //represents an unsolved node. unsolved + 1 is solving, unsolved + 2 is solved.
    node* nodes;
};