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

Fixed some unsed var error and long line issue from github merge test

Browse Source
This commit is contained in:
miltonbhowmick 2023-08-08 11:46:24 +06:00
parent 9972afa80a
commit 60a8d009eb
1 changed files with 18 additions and 9 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

27
graphs/uniform_search_cost.py
View File

@ -1,11 +1,8 @@
import heapq import heapq
import doctest
class UniformCostSearch: class UniformCostSearch:
def __init__( def __init__(self, grid: list[list[int]]) -> None:
self, current: list[int], final: list[int], grid: list[list[int]]
) -> None:
self.m = len(grid[0]) self.m = len(grid[0])
self.n = len(grid) self.n = len(grid)
@ -86,7 +83,13 @@ class UniformCostSearch:
) -> list[list[int]]: ) -> list[list[int]]:
""" """
Return 2D list where optimal path is stored. Return 2D list where optimal path is stored.
>>> get_shortest_path([0, 2],[2, 2], [['inf','inf',1],['inf,2,2],['inf',0,3]], [(1, 1),(1, 0),(1, -1),(0, -1),(-1, -1),(-1, 0),(-1, 1),(0, 1)]) >>> get_shortest_path(
[0, 2],[2, 2],
[['inf','inf',1],
['inf,2,2],['inf',0,3]],
[(1, 1),(1, 0),(1, -1),(0, -1),(-1, -1),(-1, 0),(-1, 1),(0, 1)]
)
[[0,2],[1,2],[2,2]] [[0,2],[1,2],[2,2]]
""" """
shortest_path = [] shortest_path = []
@ -120,7 +123,15 @@ class UniformCostSearch:
) -> list[list[int]]: ) -> list[list[int]]:
""" """
Return 2D list where optimal path is stored. Return 2D list where optimal path is stored.
>>> ucs([0, 2],[[1,2],[2, 2]], [[0,0,0],[0,0,0],[0,0,0]], [[None, None, None], [None, None, None],[None, None, None]], [(1, 1),(1, 0),(1, -1),(0, -1),(-1, -1),(-1, 0),(-1, 1),(0, 1)], [1000000, 100000]) >>> ucs(
[0, 2],
[[1,2],[2, 2]],
[[0,0,0],[0,0,0],[0,0,0]],
[[None, None, None], [None, None, None],[None, None, None]],
[(1, 1),(1, 0),(1, -1),(0, -1),(-1, -1),(-1, 0),(-1, 1),(0, 1)],
[1000000, 100000]
)
[[0,2],[1,2],[2,2]] [[0,2],[1,2],[2,2]]
""" """
@ -193,7 +204,7 @@ class UniformCostSearch:
elif start_point[0] - end_point[0] < 0: elif start_point[0] - end_point[0] < 0:
dxy = self.dxy1 dxy = self.dxy1
goal_answer = [] goal_answer = []
for cell in end_point: for _ in range(0, len(end_point)):
goal_answer.append(10**8) goal_answer.append(10**8)
path = self.ucs(start_point, [end_point], grid, prev, dxy, goal_answer) path = self.ucs(start_point, [end_point], grid, prev, dxy, goal_answer)
return path return path
@ -206,8 +217,6 @@ def run() -> None:
None None
""" """
executed_object = UniformCostSearch( executed_object = UniformCostSearch(
[0, 7],
[19, 17],
[ [
[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0],
[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0],