mirror of
https://github.com/TheAlgorithms/Python.git
synced 2025-07-05 01:09:40 +08:00
Enable ruff PLR5501 rule (#11332)
* Enable ruff PLR5501 rule * [pre-commit.ci] auto fixes from pre-commit.com hooks for more information, see https://pre-commit.ci --------- Co-authored-by: pre-commit-ci[bot] <66853113+pre-commit-ci[bot]@users.noreply.github.com>
This commit is contained in:
@ -120,29 +120,29 @@ class GraphAdjacencyList(Generic[T]):
|
||||
else:
|
||||
self.adj_list[source_vertex] = [destination_vertex]
|
||||
self.adj_list[destination_vertex] = [source_vertex]
|
||||
else: # For directed graphs
|
||||
# if both source vertex and destination vertex are present in adjacency
|
||||
# list, add destination vertex to source vertex list of adjacent vertices.
|
||||
if source_vertex in self.adj_list and destination_vertex in self.adj_list:
|
||||
self.adj_list[source_vertex].append(destination_vertex)
|
||||
# if only source vertex is present in adjacency list, add destination
|
||||
# vertex to source vertex list of adjacent vertices and create a new vertex
|
||||
# with destination vertex as key, which has no adjacent vertex
|
||||
elif source_vertex in self.adj_list:
|
||||
self.adj_list[source_vertex].append(destination_vertex)
|
||||
self.adj_list[destination_vertex] = []
|
||||
# if only destination vertex is present in adjacency list, create a new
|
||||
# vertex with source vertex as key and assign a list containing destination
|
||||
# vertex as first adjacent vertex
|
||||
elif destination_vertex in self.adj_list:
|
||||
self.adj_list[source_vertex] = [destination_vertex]
|
||||
# if both source vertex and destination vertex are not present in adjacency
|
||||
# list, create a new vertex with source vertex as key and a list containing
|
||||
# destination vertex as it's first adjacent vertex. Then create a new vertex
|
||||
# with destination vertex as key, which has no adjacent vertex
|
||||
else:
|
||||
self.adj_list[source_vertex] = [destination_vertex]
|
||||
self.adj_list[destination_vertex] = []
|
||||
# For directed graphs
|
||||
# if both source vertex and destination vertex are present in adjacency
|
||||
# list, add destination vertex to source vertex list of adjacent vertices.
|
||||
elif source_vertex in self.adj_list and destination_vertex in self.adj_list:
|
||||
self.adj_list[source_vertex].append(destination_vertex)
|
||||
# if only source vertex is present in adjacency list, add destination
|
||||
# vertex to source vertex list of adjacent vertices and create a new vertex
|
||||
# with destination vertex as key, which has no adjacent vertex
|
||||
elif source_vertex in self.adj_list:
|
||||
self.adj_list[source_vertex].append(destination_vertex)
|
||||
self.adj_list[destination_vertex] = []
|
||||
# if only destination vertex is present in adjacency list, create a new
|
||||
# vertex with source vertex as key and assign a list containing destination
|
||||
# vertex as first adjacent vertex
|
||||
elif destination_vertex in self.adj_list:
|
||||
self.adj_list[source_vertex] = [destination_vertex]
|
||||
# if both source vertex and destination vertex are not present in adjacency
|
||||
# list, create a new vertex with source vertex as key and a list containing
|
||||
# destination vertex as it's first adjacent vertex. Then create a new vertex
|
||||
# with destination vertex as key, which has no adjacent vertex
|
||||
else:
|
||||
self.adj_list[source_vertex] = [destination_vertex]
|
||||
self.adj_list[destination_vertex] = []
|
||||
|
||||
return self
|
||||
|
||||
|
@ -18,11 +18,10 @@ class Heap:
|
||||
else:
|
||||
if 2 * start + 2 >= size:
|
||||
smallest_child = 2 * start + 1
|
||||
elif heap[2 * start + 1] < heap[2 * start + 2]:
|
||||
smallest_child = 2 * start + 1
|
||||
else:
|
||||
if heap[2 * start + 1] < heap[2 * start + 2]:
|
||||
smallest_child = 2 * start + 1
|
||||
else:
|
||||
smallest_child = 2 * start + 2
|
||||
smallest_child = 2 * start + 2
|
||||
if heap[smallest_child] < heap[start]:
|
||||
temp, temp1 = heap[smallest_child], positions[smallest_child]
|
||||
heap[smallest_child], positions[smallest_child] = (
|
||||
|
@ -270,24 +270,23 @@ def multi_a_star(start: TPos, goal: TPos, n_heuristic: int):
|
||||
back_pointer,
|
||||
)
|
||||
close_list_inad.append(get_s)
|
||||
elif g_function[goal] <= open_list[0].minkey():
|
||||
if g_function[goal] < float("inf"):
|
||||
do_something(back_pointer, goal, start)
|
||||
else:
|
||||
if g_function[goal] <= open_list[0].minkey():
|
||||
if g_function[goal] < float("inf"):
|
||||
do_something(back_pointer, goal, start)
|
||||
else:
|
||||
get_s = open_list[0].top_show()
|
||||
visited.add(get_s)
|
||||
expand_state(
|
||||
get_s,
|
||||
0,
|
||||
visited,
|
||||
g_function,
|
||||
close_list_anchor,
|
||||
close_list_inad,
|
||||
open_list,
|
||||
back_pointer,
|
||||
)
|
||||
close_list_anchor.append(get_s)
|
||||
get_s = open_list[0].top_show()
|
||||
visited.add(get_s)
|
||||
expand_state(
|
||||
get_s,
|
||||
0,
|
||||
visited,
|
||||
g_function,
|
||||
close_list_anchor,
|
||||
close_list_inad,
|
||||
open_list,
|
||||
back_pointer,
|
||||
)
|
||||
close_list_anchor.append(get_s)
|
||||
print("No path found to goal")
|
||||
print()
|
||||
for i in range(n - 1, -1, -1):
|
||||
|
Reference in New Issue
Block a user