mirror of
https://github.com/TheAlgorithms/Python.git
synced 2024-11-30 16:31:08 +00:00
72bd653e04
* [ADD] Test cases for all_combinations * [DEL] documentation reverted b/c redundant * Update all_combinations.py --------- Co-authored-by: Christian Clauss <cclauss@me.com> |
||
---|---|---|
.. | ||
__init__.py | ||
all_combinations.py | ||
all_permutations.py | ||
all_subsequences.py | ||
coloring.py | ||
combination_sum.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_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.