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
2021/d15/ex1/ex1.py
View file

@ -22,7 +22,7 @@ def solve(input: List[str]) -> int:
continue
yield Point(x, y)
def djikstra(start: Point, end: Point) -> int:
def dijkstra(start: Point, end: Point) -> int:
# Priority queue of (distance, point)
queue = [(0, start)]
seen: Set[Point] = set()
@ -42,7 +42,7 @@ def solve(input: List[str]) -> int:
assert False # Sanity check
return djikstra(Point(0, 0), Point(len(levels) - 1, len(levels[0]) - 1))
return dijkstra(Point(0, 0), Point(len(levels) - 1, len(levels[0]) - 1))
def main() -> None:

4
2021/d15/ex2/ex2.py
View file

@ -43,7 +43,7 @@ def solve(input: List[str]) -> int:
continue
yield Point(x, y)
def djikstra(start: Point, end: Point) -> int:
def dijkstra(start: Point, end: Point) -> int:
# Priority queue of (distance, point)
queue = [(0, start)]
seen: Set[Point] = set()
@ -63,7 +63,7 @@ def solve(input: List[str]) -> int:
assert False # Sanity check
return djikstra(Point(0, 0), Point(len(levels) - 1, len(levels[0]) - 1))
return dijkstra(Point(0, 0), Point(len(levels) - 1, len(levels[0]) - 1))
def main() -> None: