thib8956/advent-of-code
1
0
Fork 0
mirror of https://github.com/thib8956/advent-of-code.git synced 2026-06-15 21:48:16 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity

2015 day 9

Browse Source
This commit is contained in:
Thibaud Gasser
2026-06-02 13:25:23 +02:00
parent f2f22b08a0
commit 673f9a0205
2 changed files with 40 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files
adventofcode/2024/day18/day18.py
+4 -1
View File
@@ -28,7 +28,10 @@ def can_reach(pos, obstacles, grid_size):
return False
def search(obstacles, start, goal, grid_size): # could just use bfs?
def search(obstacles, start, goal, grid_size):
"""
Dijkstra's algorithm. Could as well use BFS since step costs are uniform. (n = Node(new_pos, node.cost + 1))
"""
queue = [Node(start)]
visited = set()
i = 0