treewide: fix 'dijkstra' typo

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

View file

@ -92,7 +92,7 @@ def solve(input: str) -> int:
for gear in (Gear.TORCH, Gear.NEITHER):
yield 1 + (7 if gear != explorer.gear else 0), Explorer(n, gear)
def djikstra(start: Explorer, end: Explorer, cave: Cave) -> int:
def dijkstra(start: Explorer, end: Explorer, cave: Cave) -> int:
# Priority queue of (distance, point)
queue = [(0, start)]
seen: set[Explorer] = set()
@ -116,7 +116,7 @@ def solve(input: str) -> int:
cave = Cave(depth, target)
start = Explorer(Point(0, 0), Gear.TORCH)
end = Explorer(target, Gear.TORCH)
return djikstra(start, end, cave)
return dijkstra(start, end, cave)
def main() -> None: