mirror of
https://github.moeyy.xyz/https://github.com/trekhleb/javascript-algorithms.git
synced 2024-09-20 07:43:04 +08:00
Update README.md
Fixed some typos on README.
This commit is contained in:
parent
a123b9017d
commit
4327d7b480
@ -233,7 +233,7 @@ algorithm is an abstraction higher than a computer program.
|
||||
* `A` [Bellman-Ford Algorithm](src/algorithms/graph/bellman-ford) - finding the shortest path to all graph vertices
|
||||
* `A` [Floyd-Warshall Algorithm](src/algorithms/graph/floyd-warshall) - find the shortest paths between all pairs of vertices
|
||||
* `A` [Regular Expression Matching](src/algorithms/string/regular-expression-matching)
|
||||
* **Backtracking** - similarly to brute force, try to generate all possible solutions, but each time you generate next solution you test
|
||||
* **Backtracking** - similarly to brute force, try to generate all possible solutions, but each time you generate the next solution you test
|
||||
if it satisfies all conditions, and only then continue generating subsequent solutions. Otherwise, backtrack, and go on a
|
||||
different path of finding a solution. Normally the DFS traversal of state-space is being used.
|
||||
* `B` [Jump Game](src/algorithms/uncategorized/jump-game)
|
||||
@ -286,7 +286,7 @@ rm -rf ./node_modules
|
||||
npm i
|
||||
```
|
||||
|
||||
Also make sure that you're using a correct Node version (`>=14.16.0`). If you're using [nvm](https://github.com/nvm-sh/nvm) for Node version management you may run `nvm use` from the root folder of the project and the correct version will be picked up.
|
||||
Also make sure that you're using the correct Node version (`>=14.16.0`). If you're using [nvm](https://github.com/nvm-sh/nvm) for Node version management you may run `nvm use` from the root folder of the project and the correct version will be picked up.
|
||||
|
||||
**Playground**
|
||||
|
||||
|
Loading…
Reference in New Issue
Block a user