Python/project_euler/problem_054
Linus M. Henkel 5b0890bd83
Dijkstra algorithm with binary grid (#8802)
* Create TestShiva

* Delete TestShiva

* Implementation of the Dijkstra-Algorithm in a binary grid

* Update double_ended_queue.py

* [pre-commit.ci] auto fixes from pre-commit.com hooks

for more information, see https://pre-commit.ci

* Update least_common_multiple.py

* Update sol1.py

* Update pyproject.toml

* Update pyproject.toml

* https://github.com/astral-sh/ruff-pre-commit v0.0.274

---------

Co-authored-by: ShivaDahal99 <130563462+ShivaDahal99@users.noreply.github.com>
Co-authored-by: jlhuhn <134317018+jlhuhn@users.noreply.github.com>
Co-authored-by: Christian Clauss <cclauss@me.com>
Co-authored-by: pre-commit-ci[bot] <66853113+pre-commit-ci[bot]@users.noreply.github.com>
2023-06-22 13:49:09 +02:00
..
__init__.py Rename Project Euler directories and other dependent changes (#3300) 2020-10-15 12:43:28 +05:30
poker_hands.txt Rename Project Euler directories and other dependent changes (#3300) 2020-10-15 12:43:28 +05:30
sol1.py Dijkstra algorithm with binary grid (#8802) 2023-06-22 13:49:09 +02:00
test_poker_hand.py refactor: Move constants outside of variable scope (#7262) 2022-10-16 15:03:29 +05:30