From 2c258fb6d5de52deaea71fde417a874322a2efcc Mon Sep 17 00:00:00 2001
From: tonywesoly <apalecapalec@gmail.com>
Date: Thu, 12 May 2022 22:53:19 +0200
Subject: [PATCH] fixes

---
 Environment.py | 2 +-
 Min_heap.py    | 8 +++++---
 2 files changed, 6 insertions(+), 4 deletions(-)

diff --git a/Environment.py b/Environment.py
index 0a957c3..1cd1c4d 100644
--- a/Environment.py
+++ b/Environment.py
@@ -38,7 +38,7 @@ class Environment:
             for field in row:
                 field.draw()
         self.grid.draw_grid()
-        # self.astar.draw_path(self.window)
+        self.astar.draw_path(self.window)
         pygame.display.flip()
         
     def update_all_elements(self):
diff --git a/Min_heap.py b/Min_heap.py
index 633bc11..cb22778 100644
--- a/Min_heap.py
+++ b/Min_heap.py
@@ -23,11 +23,11 @@ class Min_heap:
     def heapify(self, i):
         l = self.left(i)
         r = self.right(i)
-        if l < len(self.items) - 1 and self.items[l] < self.items[i]:
+        if l < len(self.items) and self.items[l] < self.items[i]:
             smallest = l
         else:
             smallest = i
-        if r < len(self.items) - 1 and self.items[r] < self.items[smallest]:
+        if r < len(self.items) and self.items[r] < self.items[smallest]:
             smallest = r
         if smallest != i:
             self.items[i], self.items[smallest] = self.items[smallest], self.items[i]
@@ -51,6 +51,7 @@ class Min_heap:
             print("Nowy klucz wiekszy od klucza aktualnego!")
             return
         self.items[index] = item
+        self.items[index].heap_index = index
         while index > 0 and self.items[self.parent(index)] > self.items[index]:
             self.items[index], self.items[self.parent(
                 index)] = self.items[self.parent(index)], self.items[index]
@@ -61,8 +62,9 @@ class Min_heap:
     def insert(self, item):
         temp_node = Node(State(0,0,0),False)
         temp_node.h_cost = math.inf
+        temp_node.heap_index = len(self.items) - 1
         self.items.append(temp_node)
-        item.heap_index = len(self.items) - 1
+        # item.heap_index = len(self.items) - 1
         self.decrese_key(len(self.items) - 1, item)
 
     def count(self):