fixed path nodes and edges functions (#68)

Author: DvirDukhan

redisgraph/path.py

@@ -5,52 +5,52 @@ class Path(object):
 
     def __init__(self, nodes, edges):
         assert(isinstance(nodes, list) and isinstance(edges, list))
-        self.nodes = nodes
-        self.edges = edges
+        self._nodes = nodes
+        self._edges = edges
         self.append_type = Node
 
     @classmethod
     def new_empty_path(cls):
         return cls([], [])
 
     def nodes(self):
-        return self.nodes
+        return self._nodes
 
     def edges(self):
-        return self.edges
+        return self._edges
 
     def get_node(self, index):
-        return self.nodes[index]
+        return self._nodes[index]
 
     def get_relationship(self, index):
-        return self.edges[index]
+        return self._edges[index]
 
     def first_node(self):
-        return self.nodes[0]
+        return self._nodes[0]
 
     def last_node(self):
-        return self.nodes[-1]
+        return self._nodes[-1]
 
     def edge_count(self):
-        return len(self.edges)
+        return len(self._edges)
 
     def nodes_count(self):
-        return len(self.nodes)
+        return len(self._nodes)
 
     def add_node(self, node):
         assert(type(node) == self.append_type)
-        self.nodes.append(node)
+        self._nodes.append(node)
         self.append_type = Edge
         return self
 
     def add_edge(self, edge):
         assert(type(edge) == self.append_type)
-        self.edges.append(edge)
+        self._edges.append(edge)
         self.append_type = Node
         return self
 
     def __eq__(self, other):
-        return self.nodes == other.nodes and self.edges == other.edges
+        return self.nodes() == other.nodes() and self.edges() == other.edges()
 
     def __str__(self):
         res = "<"