-
Notifications
You must be signed in to change notification settings - Fork 0
/
Node.h
106 lines (82 loc) · 1.85 KB
/
Node.h
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
#ifndef NODE_H
#define NODE_H
/*
* This data structure will represent a node in the map.
*/
struct Node {
/* Member Variables */
int row,col;
bool editable, wall, accessed, path;
//parent is used to determine the path to an object within pathfinding algorithms
Node* parent = nullptr;
/*
* CONSTRUCTORS
*/
Node(int row, int col){
this->row = row;
this->col = col;
this->wall = false;
this->accessed = false;
this->editable = true;
this->path = false;
}
Node(int row, int col, bool editable){
this->row = row;
this->col = col;
this->wall = false;
this->accessed = false;
this->editable = editable;
this->path = false;
}
Node(){
this->row = -1;
this->col = -1;
this->wall = false;
this->accessed = false;
this->editable = false;
this->path = false;
}
/*
* FUNCTIONS
*/
int getRow(){
return this->row;
}
int getCol(){
return this->col;
}
bool isWall(){
return this->wall;
}
bool isEditable(){
return this->editable;
}
bool isAccessed(){
return this->accessed;
}
bool isPath(){
return this->path;
}
void setEditable(bool editable){
this->editable = editable;
}
void setWall(bool wall){
if(isEditable() && !isPath())
this->wall = wall;
}
void setAccessed(bool accessed){
if(this->isEditable())
this->accessed = accessed;
}
void setPath(bool path){
if(this->isEditable())
this->path = path;
}
void setParent(Node* parent){
this->parent = parent;
}
Node* getParent(){
return this->parent;
}
};
#endif // NODE_H