mathdatech/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2025-02-25 10:28:39 +00:00
Code Issues Packages Projects Releases Wiki Activity

Apply suggestions from code review

Browse Source
This commit is contained in:
Tianyi Zheng 2023-08-15 15:49:11 -07:00 committed by GitHub
parent c63a974c49
commit 7a865eac31
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 2 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
graphs/greedy_best_first.py
View File

@ -6,7 +6,7 @@ from __future__ import annotations
Path = list[tuple[int, int]] Path = list[tuple[int, int]]
# 0 are free path whereas 1's are obstacles # 0's are free path whereas 1's are obstacles
TEST_GRIDS = [ TEST_GRIDS = [
[ [
[0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0],
@ -83,7 +83,7 @@ class Node:
def __lt__(self, other) -> bool: def __lt__(self, other) -> bool:
return self.f_cost < other.f_cost return self.f_cost < other.f_cost
def __eq__(self, other): def __eq__(self, other) -> bool:
return self.pos == other.pos return self.pos == other.pos