mirror of
https://github.com/TheAlgorithms/Python.git
synced 2024-11-23 21:11:08 +00:00
43a47e01eb
* Add word ladder algorithm in backtracking * Improve comments and implement ruff checks * updating DIRECTORY.md * [pre-commit.ci] auto fixes from pre-commit.com hooks for more information, see https://pre-commit.ci * Change BFS to Backtracking * [pre-commit.ci] auto fixes from pre-commit.com hooks for more information, see https://pre-commit.ci * Incorporate PR Changes * [pre-commit.ci] auto fixes from pre-commit.com hooks for more information, see https://pre-commit.ci * Add type hints for backtrack function * [pre-commit.ci] auto fixes from pre-commit.com hooks for more information, see https://pre-commit.ci --------- Co-authored-by: Hardvan <Hardvan@users.noreply.github.com> Co-authored-by: pre-commit-ci[bot] <66853113+pre-commit-ci[bot]@users.noreply.github.com> |
||
---|---|---|
.. | ||
__init__.py | ||
all_combinations.py | ||
all_permutations.py | ||
all_subsequences.py | ||
coloring.py | ||
combination_sum.py | ||
crossword_puzzle_solver.py | ||
generate_parentheses.py | ||
hamiltonian_cycle.py | ||
knight_tour.py | ||
match_word_pattern.py | ||
minimax.py | ||
n_queens_math.py | ||
n_queens.py | ||
power_sum.py | ||
rat_in_maze.py | ||
README.md | ||
sudoku.py | ||
sum_of_subsets.py | ||
word_ladder.py | ||
word_search.py |
Backtracking
Backtracking is a way to speed up the search process by removing candidates when they can't be the solution of a problem.