From f55e3c220268d106b19689ef5ac1c2d36ea36437 Mon Sep 17 00:00:00 2001 From: name Date: Mon, 8 Aug 2022 08:38:11 -0700 Subject: [PATCH 1/2] update-readme --- README.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/README.md b/README.md index 4a870ccf..f261b86e 100644 --- a/README.md +++ b/README.md @@ -277,7 +277,7 @@ npm test -- 'LinkedList' **Troubleshooting** -In case if linting or testing is failing try to delete the `node_modules` folder and re-install npm packages: +If linting or testing is failing, try to delete the `node_modules` folder and re-install npm packages: ``` rm -rf ./node_modules From 13521b2fc486354a467386e7ed9d092e7992268a Mon Sep 17 00:00:00 2001 From: name Date: Tue, 9 Aug 2022 16:17:36 -0700 Subject: [PATCH 2/2] deploy --- src/algorithms/graph/breadth-first-search/README.md | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/src/algorithms/graph/breadth-first-search/README.md b/src/algorithms/graph/breadth-first-search/README.md index 32ec3e81..06073abd 100644 --- a/src/algorithms/graph/breadth-first-search/README.md +++ b/src/algorithms/graph/breadth-first-search/README.md @@ -1,7 +1,7 @@ # Breadth-First Search (BFS) -Breadth-first search (BFS) is an algorithm for traversing -or searching tree or graph data structures. It starts at +Breadth-first search (BFS) is an algorithm for traversing, +searching tree, or graph data structures. It starts at the tree root (or some arbitrary node of a graph, sometimes referred to as a 'search key') and explores the neighbor nodes first, before moving to the next level neighbors.