ambroisie/advent-of-code
1
0
Fork 0
Code Issues Pull requests Projects Releases Wiki Activity

treewide: fix 'dijkstra' typo

Browse source 
The downside of copy-pasting snippets from previous solutions :').
This commit is contained in:
Bruno BELANYI 2025-05-20 02:03:36 +01:00
parent 7dee19ff44
commit b4d9ecf0a5
10 changed files with 20 additions and 20 deletions
Download patch file Download diff file Expand all files Collapse all files

4
2024/d18/ex2/ex2.py
View file

@ -27,7 +27,7 @@ def solve(input: str) -> str:
def parse(input: list[str]) -> list[Point]:
return [Point(*map(int, line.split(","))) for line in input]
def djikstra(start: Point, end: Point, blocks: set[Point]) -> int | None:
def dijkstra(start: Point, end: Point, blocks: set[Point]) -> int | None:
# Priority queue of (distance, point)
queue = [(0, start)]
seen: set[Point] = set()
@ -58,7 +58,7 @@ def solve(input: str) -> str:
low, high = 0, len(blocks)
while low < high:
mid = low + (high - low) // 2
if djikstra(start, end, set(blocks[: mid + 1])) is None:
if dijkstra(start, end, set(blocks[: mid + 1])) is None:
high = mid
else:
low = mid + 1