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
2019/d20/ex1/ex1.py
View file

@ -73,7 +73,7 @@ def solve(input: str) -> int:
graph = to_graph(paths, post_process_gates(letters, paths))
return graph, next(iter(gates["AA"])), next(iter(gates["ZZ"]))
def djikstra(start: Point, end: Point, graph: Graph) -> int:
def dijkstra(start: Point, end: Point, graph: Graph) -> int:
# Priority queue of (distance, point)
queue = [(0, start)]
seen: set[Point] = set()
@ -94,7 +94,7 @@ def solve(input: str) -> int:
assert False # Sanity check
graph, start, end = parse(input.splitlines())
return djikstra(start, end, graph)
return dijkstra(start, end, graph)
def main() -> None:

4
2019/d20/ex2/ex2.py
View file

@ -87,7 +87,7 @@ def solve(input: str) -> int:
graph = to_graph(paths, post_process_gates(letters, paths))
return graph, next(iter(gates["AA"])), next(iter(gates["ZZ"]))
def djikstra(start: Point, end: Point, graph: Graph) -> int:
def dijkstra(start: Point, end: Point, graph: Graph) -> int:
# Priority queue of (distance, point, level)
queue = [(0, start, 0)]
seen: set[tuple[Point, int]] = set()
@ -112,7 +112,7 @@ def solve(input: str) -> int:
assert False # Sanity check
graph, start, end = parse(input.splitlines())
return djikstra(start, end, graph)
return dijkstra(start, end, graph)
def main() -> None: