My Advent of Code solutions in Python.
kevinyap.ca/2019/12/going-fast-in-advent-of-code/
advent-of-code
python
Update day24.py
+1
-3
+1
-3
2016/day24.py
+1
-3
2016/day24.py
···
30
30
already seen is valid so long as h(n) is admissible.
31
31
"""
32
32
33
-
frontier = []
33
+
frontier = [(0, start)]
34
34
seen = set()
35
35
cost_to = {start: 0} # this is g(n)
36
-
37
-
heapq.heappush(frontier, (0, start))
38
36
39
37
while frontier:
40
38
_priority, (x, y) = heapq.heappop(frontier)