diff --git a/src/BFS.py b/src/BFS.py
index 82de383..8d8dc54 100644
--- a/src/BFS.py
+++ b/src/BFS.py
@@ -1,7 +1,7 @@
 import queue
 from typing import Tuple, List
 
-from Node import Node
+from node import Node
 from tile import Tile
 from const import DIRECTIONS_X, DIRECTIONS_Y
 
@@ -18,7 +18,7 @@ def successor(x: int, y: int):
     return neighbours
 
 
-def breadth_first_search(field: List[Tile], start_x: int, start_y: int, goal: Tuple[int]):
+def breadth_first_search(field: List[Tile], start_x: int, start_y: int, goal: Tuple[int, int]):
     # TODO
     # 1. Implementacja akcji (zapisywanie tego co robot musi zrobić by przejść z jednego node do drugiego)
     # 2. Wypisanie drogi razem z akcjami
diff --git a/src/Node.py b/src/node.py
similarity index 100%
rename from src/Node.py
rename to src/node.py