You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
*[Dijkstra Algorithm](https://github.com/trekhleb/javascript-algorithms/tree/master/src/algorithms/graph/dijkstra) - finding shortest path to all graph vertices
@@ -139,7 +139,7 @@ algorithm is an abstraction higher than a computer program.
139
139
*[Bellman-Ford Algorithm](https://github.com/trekhleb/javascript-algorithms/tree/master/src/algorithms/graph/bellman-ford) - finding shortest path to all graph vertices
140
140
***Backtracking** - similarly to brute force, try to generate all possible solutions, but each time you generate a solution test
141
141
if it satisfies all conditions, and only then continue generating subsequent solutions. Otherwise, backtrack, and go on a
142
-
different path of finding solution
142
+
different path of finding a solution
143
143
*[Hamiltonian Cycle](https://github.com/trekhleb/javascript-algorithms/tree/master/src/algorithms/graph/hamiltonian-cycle) - Visit every vertex exactly once
0 commit comments