-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathNode.h
More file actions
130 lines (104 loc) · 2.57 KB
/
Node.h
File metadata and controls
130 lines (104 loc) · 2.57 KB
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
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
#ifndef EX1_NODE_H
#define EX1_NODE_H
#include <iostream>
#include <fstream>
#include <sstream>
#include <boost/archive/text_oarchive.hpp>
#include <boost/archive/text_iarchive.hpp>
#include <boost/tokenizer.hpp>
#include <boost/algorithm/string/predicate.hpp>
#include <boost/lexical_cast.hpp>
#include <boost/assign/list_of.hpp>
#include <boost/algorithm/string.hpp>
#include <boost/iostreams/device/back_inserter.hpp>
#include <boost/iostreams/stream.hpp>
#include <boost/archive/binary_oarchive.hpp>
#include <boost/archive/binary_iarchive.hpp>
#include <iostream>
#include <boost/serialization/access.hpp>
#include <boost/serialization/assume_abstract.hpp>
#include <boost/serialization/export.hpp>
using namespace std;
/**
* class for Node.
* an abstract class for a node in the world.
*/
class Node {
protected:
bool visited;
bool obstacle;
Node* daddy;
friend class boost::serialization::access;
template<class Archive>
void serialize(Archive &ar, const unsigned int version)
{
ar & visited;
ar & obstacle;
ar & daddy;
}
public:
/**
* constructor for Node.
*/
Node();
/**
* Copy constructor for Node.
*/
Node(Node* node);
/**
* setting daddy of a node.
* @param dad
*/
virtual void setDaddy(Node* dad);
/**
* get the daddy of a node.
* @return Node*
*/
Node* getDaddy() const;
/**
* return true if the node was already visited.
* @return bool
*/
bool isVisited() const;
//return true if obstacle.
bool isObstacle() const;
//set obstacle.
void setObstacle(bool obstacle);
/**
* setting true if the node has been visited.
* @param visited
*/
void setVisited(bool visited);
/**
* return true if the nodes are equal.
* @param p
* @return bool
*/
virtual inline bool operator==(Node* p) const = 0;
/**
* return true if the nodes are not equal.
* @param p
* @return
*/
virtual inline bool operator!=(Node* p) const = 0;
//operator for +.
virtual inline Node* operator+(Node* p) const = 0;
/**
* function to print nodes.
* @param output
*/
virtual void printNode(ostream& output) const = 0;
/**
* operator overloading ("<<") to print nodes.
* @param output
* @param n
* @return ostream&
*/
friend ostream& operator<<(ostream &output, const Node* n);
/**
* destructor for node.
*/
virtual ~Node() {};
};
BOOST_SERIALIZATION_ASSUME_ABSTRACT(Node)
#endif //EX1_NODE_H