onyx_online/grokking-algorithms
1
0
Fork 0
mirror of https://github.com/onyx-and-iris/grokking-algorithms.git synced 2024-11-15 17:30:52 +00:00
Code Issues Packages Projects Releases Wiki Activity

add visited set

Browse Source
This commit is contained in:
onyx-and-iris 2024-02-19 00:03:44 +00:00
parent 1d22356ce5
commit ab09aa5269
3 changed files with 15 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

5
chapter9/with_heap/ex171a.py
View File

@ -20,10 +20,15 @@ def dijkstra(graph, node):
costs[node] = 0 costs[node] = 0
parents = {node: None for node in graph} parents = {node: None for node in graph}
queue = [(0, node)] queue = [(0, node)]
visited = set()
while queue: while queue:
current_cost, current_node = heapq.heappop(queue) current_cost, current_node = heapq.heappop(queue)
if current_node in visited:
continue
logger.debug(f"node {current_node} with cost {current_cost} popped from pqueue") logger.debug(f"node {current_node} with cost {current_cost} popped from pqueue")
visited.add(current_node)
for next_node, weight in graph[current_node].items(): for next_node, weight in graph[current_node].items():
new_cost = current_cost + weight new_cost = current_cost + weight

5
chapter9/with_heap/ex171b.py
View File

@ -19,10 +19,15 @@ def dijkstra(graph, node):
costs[node] = 0 costs[node] = 0
parents = {node: None for node in graph} parents = {node: None for node in graph}
queue = [(0, node)] queue = [(0, node)]
visited = set()
while queue: while queue:
current_cost, current_node = heapq.heappop(queue) current_cost, current_node = heapq.heappop(queue)
if current_node in visited:
continue
logger.debug(f"node {current_node} with cost {current_cost} popped from pqueue") logger.debug(f"node {current_node} with cost {current_cost} popped from pqueue")
visited.add(current_node)
for next_node, weight in graph[current_node].items(): for next_node, weight in graph[current_node].items():
new_cost = current_cost + weight new_cost = current_cost + weight

5
chapter9/with_heap/ex171c.py
View File

@ -19,10 +19,15 @@ def dijkstra(graph, node):
costs[node] = 0 costs[node] = 0
parents = {node: None for node in graph} parents = {node: None for node in graph}
queue = [(0, node)] queue = [(0, node)]
visited = set()
while queue: while queue:
current_cost, current_node = heapq.heappop(queue) current_cost, current_node = heapq.heappop(queue)
if current_node in visited:
continue
logger.debug(f"node {current_node} with cost {current_cost} popped from pqueue") logger.debug(f"node {current_node} with cost {current_cost} popped from pqueue")
visited.add(current_node)
for next_node, weight in graph[current_node].items(): for next_node, weight in graph[current_node].items():
new_cost = current_cost + weight new_cost = current_cost + weight