From 64552d16f31ea79e6f52b6f7f75def7ee0783227 Mon Sep 17 00:00:00 2001 From: Oleksii Trekhleb Date: Sat, 19 May 2018 23:15:25 +0300 Subject: [PATCH] Update README. --- README.md | 4 +++- 1 file changed, 3 insertions(+), 1 deletion(-) diff --git a/README.md b/README.md index fecf14b3..8f4ae767 100644 --- a/README.md +++ b/README.md @@ -130,7 +130,9 @@ algorithm is an abstraction higher than a computer program. * [Integer Partition](https://github.com/trekhleb/javascript-algorithms/tree/master/src/algorithms/math/integer-partition) * [Maximum Subarray](https://github.com/trekhleb/javascript-algorithms/tree/master/src/algorithms/sets/maximum-subarray) * [Bellman-Ford Algorithm](https://github.com/trekhleb/javascript-algorithms/tree/master/src/algorithms/graph/bellman-ford) - finding shortest path to all graph vertices -* **Backtracking** - similarly to brute force try to generate all possible solutions but each time you generate a solution test if it satisfies all conditions, and only then continue generating subsequent solutions. Otherwise backtrack and go on a different path of finding solution. +* **Backtracking** - similarly to brute force try to generate all possible solutions but each time you generate a solution test +if it satisfies all conditions, and only then continue generating subsequent solutions. Otherwise backtrack and go on a +different path of finding solution * [Hamiltonian Cycle](https://github.com/trekhleb/javascript-algorithms/tree/master/src/algorithms/graph/hamiltonian-cycle) - Visit every vertex exactly once * [N-Queens Problem](https://github.com/trekhleb/javascript-algorithms/tree/master/src/algorithms/uncategorized/n-queens) * [Knight's Tour](https://github.com/trekhleb/javascript-algorithms/tree/master/src/algorithms/uncategorized/knight-tour)