From a17791d022bdc942c8badabc52307c354069a7ae Mon Sep 17 00:00:00 2001
From: Juyoung Kim <61103343+JadeKim042386@users.noreply.github.com>
Date: Thu, 25 May 2023 21:54:18 +0900
Subject: [PATCH] fix: graphs/greedy_best_first typo (#8766)

#8764
---
 graphs/greedy_best_first.py | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/graphs/greedy_best_first.py b/graphs/greedy_best_first.py
index d49e65b9d..35f7ca9fe 100644
--- a/graphs/greedy_best_first.py
+++ b/graphs/greedy_best_first.py
@@ -58,8 +58,8 @@ class Node:
         The heuristic here is the Manhattan Distance
         Could elaborate to offer more than one choice
         """
-        dy = abs(self.pos_x - self.goal_x)
-        dx = abs(self.pos_y - self.goal_y)
+        dx = abs(self.pos_x - self.goal_x)
+        dy = abs(self.pos_y - self.goal_y)
         return dx + dy
 
     def __lt__(self, other) -> bool: